PEGEX: a PEG-based pattern matching library EXtended by back reference with regex-like notation in Scala
Kota Mizushima

I would like to talk about PEGEX, which I have been developping and is a pattern matching library based on parsing expression grammars (PEGs) extended by back reference with regex-like "light-weight" notation. Scala's PEG parser combinator library is very expressive and extensible. However, its syntax is too "heavy-weight" for pattern matching to strings. In such cases, we can use scala.util.matching.Regex class instead of PEG parser combinator library because Regex's syntax is "light-weight". But Regex cannot handle strings that have recursive structure easily. PEGEX is the combination of power of PEG and "light-weight" notation of Regex. Additionally, PEGEX have "back reference", which I borrowed from Regex for the cases such as correspondence of tag names of XML. I will talk about design, implementation, and usage of PEGEX. Currently PEGEX is being developed internally and not released yet. I'm planning to release PEGEX after a few months.