TOC - Grammar

Production Rule:

aAb->agb

belongs to which of the following category?

• Regular Grammar

• Context free Grammar

• Recursively Ennumerable Grammar

• Context Senstive Grammar

The Grammar can be defined as: G=(V, ∑, p, S)

In the given definition, what does S represents?

• Accepting State

• Starting Variable

• Sensitive Grammar

• Starting Terminal

For S -> 0S1 | e for ∑={0,1}*,

which of the following is wrong about the language produced by the above grammar?

• 0ⁿ1ⁿ | n>=0

• 0ⁿ1ⁿ | n>=1

• 0^K1^K | K>=0

• 0ⁿ⁺¹1ⁿ | n>=1

A -> aA | a | b

The number of steps to form aab:

• 2

• 3

• 4

• None of these

A -> aA | a | b

The number of steps to form abb:

• 2

• 3

• 4

• None of these

What the does the given CFG defines?

S->aSbS | bSaS | e and w denotes terminal

• wwS

• wSw

• Equal number of a’s and b’s

• None of these

A grammar G=(V, T, P, S) is __________

if every production taken one of the two forms:

A -> a

B -> bB

• Regular

• Non-Regular

• Ambiguous

• None of these

The most suitable data structure used to represent the derivations in compiler:

• Stack

• Queue

• Tree

• Linked List

Which among the following is the root of the parse tree?

• Production P

• Terminal T

• Variable V

• Starting Variable S

A grammar with more than one parse tree is called:

• Unambiguous

• Ambiguous

• Regular

• None of these