Welcome to the Context Free Grammar and Syntax Analysis MCQs Page

Dive deep into the fascinating world of Context Free Grammar and Syntax Analysis with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Context Free Grammar and Syntax Analysis, a crucial aspect of Compiler Design. In this section, you will encounter a diverse range of MCQs that cover various aspects of Context Free Grammar and Syntax Analysis, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Compiler Design.

Check out the MCQs below to embark on an enriching journey through Context Free Grammar and Syntax Analysis. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Compiler Design.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Context Free Grammar and Syntax Analysis. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Context Free Grammar and Syntax Analysis MCQs | Page 3 of 4

Explore more Topics under Compiler Design

01

Introduction to Compilers

02

Finite Automata and Regular Expression

03

Topdown Parsing

04

Bottom Up Parsing

05

Syntax Directed Definition and Translations

06

Symbol Table

07

Storage Management

08

Error Handling

09

Code Optimization

10

Code Generation

Q21.

How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

Discuss

Answer: (d).11

Q22.

Give a production grammar that specified language L = {ai b2i >= 1}

{S->aSbb,S->abb}

{S->aSb, S->b}

{S->aA,S->b,A->b}

None of the mentioned

Discuss

Answer: (a).{S->aSbb,S->abb}

Q23.

Which of the following String can be obtained by the language L = {ai b2i / i >=1}

aaabbbbbb

aabbb

abbabbba

aaaabbbabb

Discuss

Answer: (a).aaabbbbbb

Q24.

The production Grammar is {S->aSbb, S->abb} is

type-3 grammar

type-2 grammar

type-1 grammar

type-0 grammar

Discuss

Answer: (b).type-2 grammar

Q25.

The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1)

1 + 0(1+0)*

(0+1)(1+0)*

(1+0)

(00+0111+10)*

Discuss

Answer: (d).(00+0111+10)*

Q26.

Non-Linear grammar has has two non-terminals on the right-hand side.

True

False

May be

Can't say

Discuss

Answer: (a).True

Q27.

Linear grammar has more than one non-terminal on the right-hand side.

True

False

May be

Can't say

Discuss

Answer: (a).True

Q28.

In Right-Linear grammars, all productions have the form: A → xB

True

False

May be

Can't say

Discuss

Answer: (a).True

Q29.

S → abS S → a is which grammar

Right Linear Grammar

Left Linear Grammar

Right & Left Linear Grammar

None of the mentioned

Discuss

Answer: (a).Right Linear Grammar

Q30.

Which Grammar is it?

Right Linear

Left Linear

None of the mentioned

Right & Left Linear

Discuss

Answer: (b).Left Linear

Page 3 of 4

Welcome to the Context Free Grammar and Syntax Analysis MCQs Page

Context Free Grammar and Syntax Analysis MCQs | Page 3 of 4

Explore more Topics under Compiler Design

Introduction to Compilers

Finite Automata and Regular Expression

Topdown Parsing

Bottom Up Parsing

Syntax Directed Definition and Translations

Symbol Table

Storage Management

Error Handling

Code Optimization

Code Generation

Suggested Topics

Hadoop

JavaScript

MATLAB

Management Information Systems

PHP

Formal Languages and Automata Theory

Software Architecture and Design

DBMS

R Programming