Yes, the behavior you describe, whereby L0 consumes 'aaaa' as "longest
acceptable match" or <B>, and then the parse fails because it cannot
find a <C>, is what happens. And this occurs regardless of the
forgiving setting.
-- jeffrey
On 01/08/2014 12:38 PM, amon wrote:
Given the grammar "A ::= B C | C C; B ~ 'a'+; C ~ 'aa'" and the input
"aaaa":
(Why) does this fail? Expected for all variants: failure because"B ~
'a'+" matches the whole input, thus starving "C".
--
You received this message because you are subscribed to the Google Groups "marpa
parser" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
