PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2022 paper

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

20227m

Convert the CFG to GNF:

S→AB∣BCA→aB∣bA∣aB→bB∣cC∣bC→c S \to AB \mid BC \\ A \to aB \mid bA \mid a \\ B \to bB \mid cC \mid b \\ C \to c

Search GoogleAsk AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYDefine Chomsky Normal Form. Convert the CFG: S → aSb | ab | Aa A → aab to CNF.20237mFormal Language & Automata TheoryConvert the following context-free grammar into GNF: S \to XY X \to YS \mid b Y \to SX \mid a20197mFORMAL LANGUAGE & AUTOMATA THEORYWrite a short note on Greibach Normal Form (GNF).20254.66mFormal Language & Automata TheoryBegin with the grammar: S \to ASB / \epsilon A \to aAS / a B \to SbS / A / bb (i) Eliminate \epsilon-productions. (ii) Eliminate unit productions in the resulting grammar. (iii) Eliminate any useless symbol in the resulting grammar. (iv) Put the resulting grammar into CNF.202214m
PreviousConstruct a CFG for: \{ 0^i 1^j 2^k \mid i + j \ge 2k \}NextDesign a Turing machine that accepts all palindromes over: \Sigma = \{ a, b \}
Free AppAndroid App

Coursify Android App

Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.

Install Coursify