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

PyQdeckBEU PYQ Archive Subjects

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 Compiler DesignGiven a context-free grammar (CFG), compute FIRST and FOLLOW sets for all non-terminals, and construct the LL(1) parsing table. Also, determine whether the grammar is LL(1) or not. Grammar: S \rightarrow A B A \rightarrow a A | \epsilon B \rightarrow b B | \epsilon20247m

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?