Re: languages

"jason_box" <cppisfun@xxxxxxxxx> writes:


S-> aSa | B | lambda
B-> bB | lambda

This is much better (in that it generates the correct language), but
it is ambiguous. You can make it unambiguous by removing the first
lambda rule:

S-> aSa | B
B-> bB | lambda

Torben
.