Using the CYK algorithm, determine whether baaba is in L(G) for the gr

Back to the 2021 paper

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

202114m

Using the CYK algorithm, determine whether baaba is in $L(G)$ for the grammar:

S → AB | BC
A → BA | a
B → CC | b
C → AB | a

Search Google Ask AI

Similar questions

Formal Language & Automata TheoryUsing the following grammar S \to AB \mid BC A \to BA \mid a B \to CC \mid b C \to AB \mid a use the CYK algorithm to determine whether the given string baaba is in L(G) or not.20197m Formal Language & Automata TheoryConsider the grammar: S \to AB \mid BC A \to BA \mid a B \to CC \mid b C \to AB \mid a Use the CYK algorithm to determine whether the given string "baaba" is in L(G) or not.202114m Compiler DesignCheck whether the following grammar is CLR or not : S \rightarrow Aa | bBa | Ba | bAc A \rightarrow c B \rightarrow d20197m FORMAL LANGUAGE & AUTOMATA THEORYGiven the following context-sensitive grammar: S \rightarrow aSBC | abc CB \rightarrow BC aB \rightarrow ab bB \rightarrow bb bC \rightarrow bc cC \rightarrow cc Identify the language generated by the grammar. Derive the string aabbcc step by step.20257m

PreviousDesign a DFA for the regular expression: 1^*(10)^*NextSuppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R - L always CFL?

Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play