...
2013 June UGC NET Paper 1
February 13, 2024
Compiler-Design
February 13, 2024
2013 June UGC NET Paper 1
February 13, 2024
Compiler-Design
February 13, 2024

Compiler-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).

A
Theory Explanation.
Correct Answer: A
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x