in Compiler Design
108 views
0 votes
0 votes
Consider the following grammar:

S→ a | ^ | ( T )

T→ T , S | S

Draw the parse tree for “ (((a,a),^,(a)),a)”
in Compiler Design
108 views

2 Comments

can you able to show your solution?
0
0
shld we remove left recursion first?
0
0

Please log in or register to answer this question.