Write a YACC program to generate syntax tree for any string accepted by following grammer:-
S->id=E
E->E+T|E-T|E*T|T
T->(E)|id
Display your syntax tree by printing in-order and post-order traversal.
-
yacc -d sol.y
-
lex sol.l
-
cc lex.yy.c y.tab.c
4 ./a.out