The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Find a grammar equivalent to $S\rightarrow aAB, A\rightarrow bBb, B\rightarrow A|\lambda$ that satisfies the conditions of Theorem 5.2.

Theorem 5.2
Suppose that $G = (V, T, S, P)$ is a context-free grammar that does not have any rules of the form $A → λ,$ or $A → B,$ where $A, B ∈ V.$ Then the exhaustive search parsing method can be made into an algorithm which, for any $w ∈ Σ^*,$ either produces a parsing of $w$ or tells us that no parsing is possible.

asked in Theory of Computation by Boss (14k points) | 17 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,541 questions
54,093 answers
71,001 users