{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}


Lecture12-1_Part36 - e.g This grammar has an infinite...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
If we try to prove this theorem by checking all possible derivations of < G >, we may run into trouble on grammars containing cycles
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , e.g. This grammar has an infinite derivation which is hard to deal with. Decidable CFG Related Languages 36 A B B A → →...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online