Show given grammar over alphabet \{a, b\}, verify whether it is ambigu

Back to the 2021 paper

Module 2: Context-free languages and pushdown automata

20217m

Show given grammar over alphabet $\{a, b\}$ , verify whether it is ambiguous or unambiguous:

$S \to aSa \mid bSb \mid a \mid b \mid \epsilon$

This question has repeated before

Also appeared in 2020.

Search Google Ask AI

Similar questions

Formal Language & Automata TheoryShow given grammar over alphabet \{a, b\} verify whether it is ambiguous or unambiguous: S \to a \mid abSb \mid aAb A \to bS \mid aAAb20207m FORMAL LANGUAGE & AUTOMATA THEORYCheck whether the grammar: S \to aSa \mid bSb \mid a \mid b is ambiguous.20217m FORMAL LANGUAGE & AUTOMATA THEORYShow that the following grammar is ambiguous: S \rightarrow SS | aSb | bSa | \epsilon20257m FORMAL LANGUAGE & AUTOMATA THEORYCheck whether the grammar is ambiguous: S \to a \mid abSb \mid aAb A \to bS \mid aAAb20247m

PreviousState and prove pumping lemma for regular sets.NextShow that the sum function f(x, y) = x + y is primitive recursive.

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