Paper Tayyari

Lecture 39: PDA corresponding to CFG

MCQs, short and long questions from lecture 39.Lecture 39 ki MCQs, short aur long sawal.

2 MCQs · 2 MCQs from past papers2 MCQs · 2 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/2
– correctsahi
1.
★ Final term Fall 2012

For every Context Free Grammar (CFG), we can make the corresponding ________ .

  1. AFA
  2. BTG
  3. CPDA
  4. DRegular Grammar

Every CFG can be converted into a PDA that accepts the same language.

2.
★ Final term past paper

Choice of path can be determined by left most derivation of the string belonging to CFL at ________ state

  1. AAccept
  2. BReject
  3. CPush
  4. DPOP

In the PDA built from a CFG the branching happens at the POP state, and the leftmost derivation picks the branch.