This is on the same line - sorry. I called maxmatch the extreme version of the stackoverflow answer: a maxmatch matches *all* lexemes, implemented in the terminfo grammar<https://github.com/jddurand/MarpaX-Database-Terminfo/blob/master/lib/MarpaX/Database/Terminfo/Grammar.pm> .
Le mercredi 8 janvier 2014 17:20:19 UTC+1, Jeffrey Kegler a écrit : > > On 01/08/2014 03:55 AM, Durand Jean-Damien wrote: > > Isn't it, also, another more elegant way to solve also the Prevent naïve > longest token matching in > Marpa::R2::Scanless<http://stackoverflow.com/questions/17773976/prevent-naive-longest-token-matching-in-marpar2scanless>question > ? > > Yes, that was one of its motivating examples. > > As an extreme case, if all lexemes are given the forgiven adverb, isn't it > a way to bypass the "maxmatch" userland lexing hook ? > > The "maxmatch" userland lexing hook? What's that? > -- 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.
