Time Left - 10:00 mins
Parser and SDT
Attempt now to get your rank among 91 students!
Question 1
Consider the statement:
I. Every regular grammar is LL(1)
II. Every LL(1) grammar is LALR(1)
III. A context free grammar without left factoring and left recursion can be ambiguous
Question 2
Which one of the following is a top-down parser?
Question 3
LR (1) item is:
Question 4
A syntax tree:
Question 5
Syntax Analyzer is which phase of the compiler?
- 91 attempts
- 0 upvotes
- 0 comments
Jul 5GATE & PSU CS
