Research Aptitude
October 8, 2023
UGC NET Dec-2020 and June-2021 Paper-1
October 8, 2023
Research Aptitude
October 8, 2023
UGC NET Dec-2020 and June-2021 Paper-1
October 8, 2023

Compiler-Design

Question 25

Consider the following grammar with terminal alphabet ∑{a,(,),+,*} and start symbol E. The production rules of the grammar are:

              E → aA
              E → (E)
              A → +E
              A → *E
              A → ε 

(a) Compute the FIRST and FOLLOW sets for E and A.
(b) Complete the LL(1) parse table for the grammar.

A
Theory Explanation is given below.
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
error: Alert: Content selection is disabled!!