Avatto > UGC NET COMPUTER SCIENCE > PRACTICE QUESTIONS > Theory of Computation and Compilers > Syntax Analysis

Theory of Computation and Compilers MCQ - Syntax Analysis

16 Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

LL(1) grammar is top down parsing. It is used in removing left recursion and factoring the grammar.

17 The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is
A. ambiguous
B. Left-recursive
C. right-recursive
D. an operator-grammar

Grammar have multiple parse trees for string ‘ε’, so grammar is ambiguous, and also A → AA has left recursion.

18 Which one of the following is a top-down parser?

Recursive descent parser is a kind of top-down parser.

19 Consider the grammar with non-terminals N = {S, C, S1}, terminals T = {a, b, i, t, e}, with S as the start symbol, and the following set of rules
S → iCtSS₁|a
S → eS|ε
C → b
The grammar is NOT LL(1) because:

It is ambiguous

20 Consider the following two statements:
P: Every regular grammar is LL (1)
Q: Every regular set has LR (1) grammar
Which of the following is TRUE?

Regular grammar may be ambigous and ambigous grammar is never LL(1).
Every regular set has a unambigous regular grammar so they are LL(1) and every LL(1) is LR(1)

Your Progress

0%

Start Practising!

You've answered 0 of 42 questions in this topic.

Weekly Brain Battle

Complete 20 questions and set the community benchmark!

0 / 20 Start Challenge →

Practice Spotlight

Build momentum in Syntax Analysis

Start with a short question set, review every explanation, and revisit difficult questions before moving ahead.

Day 3 / 10

Global Spotlight

Practise Under Exam Conditions

Use a strict timer and avoid notes. Your next improvement will come from maintaining accuracy under pressure.

Day 7 / 10

Question Spotlight

Question:

Consider the grammar with non-terminals N = {S, C, S1}, terminals T = {a, b, i, t, e}, with S as the start symbol, and the following set…

A. It is left recursive
B. It is right recursive
C. It is ambiguous
D. It is not context-free

Correct answer: C

Explanation:

It is ambiguous

Click to view the complete question details

Day 3 / 10 Open this question

Community Insight

Based on 5 saved attempts

Most Attempted TopicBasic Of Compiler Design
Most Challenging TopicBasic Of Compiler Design
Average Accuracy100%

Featured Question

(Based on recent community answers)

Q. #32645New

Consider the grammar with non-terminals N = {S, C, S1}, terminals T = {a, b,…

Try This Question →

Why Practice with Avatto?

High Quality MCQsExam-focused questions with accurate answers

Detailed ExplanationsStep-by-step explanations to enhance learning

Latest Exam PatternBased on updated syllabus and pattern

Performance AnalyticsTrack performance and improve weak areas

100% Free PracticePractice unlimited questions for free

Forgot your password?

I agree with the Terms.