Register

compiler design

• retagged by
155 views
0 votes
0 votes
how many handles detected by bottom up parser for string a+a*a?
grammar is

E->E+T|T
T->T*F|F
F->a

please draw the whole procedure and explain how bottom up parser does right most derivation in reverse in this question
• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

133
views
0 answers
0 votes
Ebrahim asked May 5
133 views
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e) 
User Avatar
95
views
0 answers
0 votes
Ebrahim asked May 5
95 views
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation.  a) Quadrupleb) Triple c) Indirect Triple Solve the above Question like this example
User Avatar
308
views
1 answers
0 votes
Ebrahim asked Jan 31
308 views
compiler design tcompiler-design-timothy-g-griffin
6. Generate code for the following C program using any code generation algorithm. [3 Marks] main() { int x, a, b, c, d, e; x= a + b -( c + d ) * e }
User Avatar
178
views
1 answers
0 votes
Rohit Chakraborty asked Jan 15
178 views
Made easy mock test question from Compiler Design
Please show the procedure for the given question.
User Avatar
Link Copied!