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]. For more options, visit https://groups.google.com/groups/opt_out.
