# $ echo  "$d_txted"  "'""$d_Qndfs""MindCode/code develop/symbols - expression parsing.txt""'"  |  xargs  -0  sh  -c  & 
# www.BillHowell.ca  25May2020 initial 
/home/bill/PROJECTS/Qnial/MY_NDFS/MindCode/code develop/symbols - expression parsing.txt


***************************************************








**********
15May2020 from ToDos : Current work :  create a system to handle "formulae"
start with :	arithmentic formulae
also use :		net finder.ndf -> [finders, taskers]
					parser.ndf - adapt Lucas project coding?, break down until actionable "components" are derived
led into by :	attention-action.df


examples of arithmetic formulae : 
eq_1	:=  '4 + 5'
eq_3	:=  '+ 4 5 6'
eq_4	:=  '2 * (4 + 5)'
eq_5	:=  
eq_6	:=  
eq_7	:=  
eq_8	:=  
eq_9	:=  

eq_1  this is straightforward
rearrange	'+ 4 5'
only one operator, which is already known '+', plus "clean data at same level
result		'+ 4 5'  
examples in 'arith, trig examples.ods'  
'opL' = '+' a must be properly-timed inputs, to the exclusion of others


17May2020 notes while at Mom&Dads (Dad in hospital, Kim was there)

MindCode Parsing

A. Definitive equations of [data, operators, transformers] 
	all symbols are known

1.	Restate problem in standard [form, notation]s
		adapt "Howell flatliner notation" code of "Lucas Universal Force"
		Q'Nial is excellent - universal grammar that does NOT assume typical arithmetic [ditributu, associa, commuta]-tive precendence

2.	QNial handles the [operator, tansformer] : 
		a) invocations
		b) call  component MindCode moduules (use casts? - probably not necessary?)

3.	But how to do the above by MindCode SNN modules?


B. Implicit expressions of [data, operators, transformers] 
	some symbols must be solved for
	

In part A above, all inputs are known, and the output is not implicit.




# enddoc