2013 June UGC NET Paper 1
February 13, 2024Compiler-Design
February 13, 2024Compiler-Design
Question 9 |
(a) Translate the arithmetic expression a*-(b+c) into syntax tree.
(b) A grammar is said to have cycles if it is the case that
A ⇒ +A
Show that no grammar that has cycles can be LL(I).
Theory Explanation. |
Correct Answer: A
Subscribe
Login
0 Comments