Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

LL(1) Parser

Which of the following is true

a: Every regular grammar is LL (1) and every regular has an LR (1) grammar b: Every regular grammar is not LL (1) and every regular set has an LR (1) grammar c: Every regular grammar is LL (1) and every regular set does not have-an LR (1) Grammar d: Every regular grammar is not LL (1) and every regular set does not have-an LR (1) grammar

What is sufficient to prove that grammar is not LL(1)

a: Grammar is non-ambiguous b: Grammar is left recursive c: Grammar is right recursive d: Grammar is not context-free

Which one of the following kinds of derivation is used by LL(1) parsers

a: leftmost b: leftmost in reverse c: rightmost d: rightmost in reverse

The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is

a: left recursive b: right recursive c: ambiguous d: operator grammar

Choose the correct Option :
Statement 1 : Predictive parsing technique avoids backtracking.
Statement 2 : LL(1) Grammar cannot be ambiguous.
Which of the following is correct about top-down parser?

a: Statement 1 only b: Statement 2 only c: Both Statement 1 and Statement 2 d: Neither statement 1 nor statement 2

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)