i have to change the infix equation into a rule for example ruler= "(( A = '1') & ( B! '2' )) | ( C = '6' ) | ((( A = '1') & ( B ! '2' )) | ( C = '6' ))"
after the change it will so as "((Rule1 & Rule2) | Rule3 | (Rule4 & rule5) | rule6)"
as it has logical/arithemetic operator again it should be parse and output will be as follows
"Rule7 | Rule3 | Rule8 | Rule 6" ==> (Rule 9 | Rule 10) ==> Rule11 final answer should be rule 11
if i check rule 9 value it should give rule 9= Rule7 | Rule 3 and so on
i have never tried an tree implementation please help me out in this
No comments:
Post a Comment