Using the following grammar S \to AB \mid BC A \to BA \mid a B \to CC — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2019 paper

Module 2: Context-free languages and pushdown automata

20197m

Using 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.

This question has repeated before

Also appeared in 2021.

Search Google Ask AI

Similar questions

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 FORMAL LANGUAGE & AUTOMATA THEORYUsing 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 ``202114m 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 Compiler DesignCheck whether the following grammar is CLR or not : S \rightarrow Aa | bBa | Ba | bAc A \rightarrow c B \rightarrow d20197m

PreviousConstruct a push-down automata that accepts the following language: L = \{uawb \mid u \text{ and } w \in \{a, b\}^* \text{ and } |u| = |w|\}NextDesign a Turing machine to perform 2's compliment operation on binary string.