Register

Compiler Design

324 views
0 votes
0 votes
Consider following grammar : 
S → A + B | A 
A → (B) | int | int * A 
The no. of newly added non-terminal symbols after left – factoring above grammar are___________.

Correct Answer: 2    Status: unattempted

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

0 votes
0 votes
0 answers
1
Sarahcs asked May 6
51 views
Compiler design
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
User Avatar
0 votes
0 votes
0 answers
2
Ebrahim asked May 5
53 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)  
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e) 
User Avatar
0 votes
0 votes
0 answers
3
Ebrahim asked May 5
39 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) Quadruple b) Triple c) Indirect Triple   Solve the above Question like this example
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 abov...
User Avatar
1 votes
1 votes
0 answers
4
Ebrahim asked May 5
41 views
Compiler Design
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0) evensum=evensum+ else oddsum=oddsum+i;
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;
User Avatar
Link Copied!