Then you might like my implementation<https://github.com/jddurand/MarpaX-Languages-ECMAScript-AST/blob/master/lib/MarpaX/Languages/ECMAScript/AST/Grammar/ECMAScript_262_5/Lexical/RegularExpressionLiteral.pm> - the only subtility in this simple grammar is that I use these user-defined character classes<https://github.com/jddurand/MarpaX-Languages-ECMAScript-AST/blob/master/lib/MarpaX/Languages/ECMAScript/AST/Grammar/CharacterClasses.pm> .
Le samedi 25 janvier 2014 19:26:59 UTC+1, rns a écrit : > > Thanks Jean Damien! I've already found a couple of some similar but this > one is very clear. > > > On Sat, Jan 25, 2014 at 8:24 PM, Durand Jean-Damien > <[email protected]<javascript:> > > wrote: > >> Note that a startup can be the ECMAScript pattern >> specification<http://www.ecma-international.org/ecma-262/5.1/#sec-15.10.1> - >> ECMAScript implements a very low subset of perl regexp pattern, but it >> shows quite well how such a grammar should be structured. >> >> Le samedi 25 janvier 2014 18:59:06 UTC+1, Jeffrey Kegler a écrit : >> >>> I like the idea. Regular expressions, as parsed using special-purpose >>> regular expression engines, will always survive, because of the speed. But >>> a lot of things people do with regular expressions would benefit from more >>> power. -- jeffrey >>> >>> -- >> 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] <javascript:>. >> For more options, visit https://groups.google.com/groups/opt_out. >> > > -- 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.
