Re: Ambuguity of CFG

It sounds like to me there is no way to prove that simple grammars can
be classified as unambigous grammars then? I konw the family of
DFA/NFA/R.E can be converted to CFG, but its not the case that all CFG
are regular. If that holds, does it not hold that all CFG can be
converted to a PDA, and all PDA have an unambigous grammar? I'm just
wondering if the statement all s-grammars are unambigous or is it a
statment that while trying to prove it you realize that it can not old
true for all simple grammars.

.