lua-users home
lua-l archive

[Date Prev][Date Next][Thread Prev][Thread Next] [Date Index] [Thread Index]


Hi,

Brian Hagerty wrote:
> However, my first thought is that since PEGs (or grammars in 
> general) are supersets of RegExps, it should not be a problem 
> (in principle) to represent RegExps in a PEG.

Backwards references and other extensions are not "regular", i.e.
"regexp" is really a misnomer (for modern implementations):

  http://en.wikipedia.org/wiki/Regular_expression#Patterns_for_irregular_languages

Bye,
     Mike