Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Compiler Design and Construction Old Questions 2071-II

Compiler Design and Construction - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

4.  Translate the arithmetic expression a*-(b+c) into syntax tree. Explain the ambiguous grammar.

6 marks
Asked in 2071-II

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...

Official Answer

Syntax tree for given arithmetic expression is shown below:

a*-(b+c) 

If a same terminal string can be derived from the grammar using two or more distinct left-most derivation (or right most) then the grammar is said to be ambiguous i.e. from an ambiguous grammar, we can get two or more distinct parse tree for the same terminal string.

For example:

E → E+E | E*E | id

String: id+id*id

Derivation 1:

Derivation 2:

For the string id + id * id, the above grammar generates two parse trees or two distinct derivation. So the grammar is ambiguous.