Search code examples
grammarregular-languagecomputation-theoryformal-languages

Ambiguous Regular Grammar?


Does such a thing exist? If so, could you please provide an example? Thanks.


Solution

  • A -> a
    B -> a
    

    can parse the string a as both A or B, and is therefore ambiguous.