PyQdeck LogoPyQdeckSubjects
Back to the 2023 paper

Module 2: Context-Free Languages (CFL) and PDA

20237m

Construct NPDA for the grammar:

S→αABB∣αAAA→αBB∣αB→bBB∣A S \to \alpha ABB \mid \alpha AA \\ A \to \alpha BB \mid \alpha \\ B \to bBB \mid A

Search GoogleAsk AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYShow whether the given grammar is ambiguous: S \to a \mid abSb \mid aAb \\ A \to bS \mid aAAb20227mFORMAL LANGUAGE & AUTOMATA THEORYCheck whether the grammar is ambiguous: S \to a \mid abSb \mid aAb A \to bS \mid aAAb20247mFormal Language & Automata TheoryDesign a pushdown automaton for the following context-free grammar: S \to aB \mid bA A \to aS \mid bAA \mid a B \to bS \mid aBB \mid b20207mFORMAL LANGUAGE & AUTOMATA THEORYCheck whether the grammar: S \to aSa \mid bSb \mid a \mid b is ambiguous.20217m
PreviousConstruct NFA for the regular expression: (0+1)^*00(0+1)^*NextProve the identity: (1+00^*1) + (1+00^*1)(0+10^*1)^*(0+10^*1) = 0^*1(0+10^*1)^*