Parsing expression grammar

Known as: PEG, Text parsing, Packrat parser 
In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Parsing Expression Grammars (PEGs) are a formalism used to describe top-down parsers with backtracking. As PEGs do not provide a… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2016
2016
Parsing Expression Grammars (PEGs) are a formalism to describe a top-down parser for a language. However, error handling… (More)
  • figure 2
  • table 1
  • figure 5
Is this relevant?
2015
2015
Parsing Expression Grammars (PEGs) define languages by specifying a recursive-descent parser that recognises them. The PEG… (More)
  • table 2
Is this relevant?
2014
2014
Most scripting languages nowadays use regex pattern-matching libraries. These regex libraries borrow the syntax of regular… (More)
  • figure 1
  • figure 4
  • table 1
  • table 2
  • table 3
Is this relevant?
2014
2014
This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is… (More)
  • table 1
  • table 2
  • table 4
  • table 5
Is this relevant?
2014
2014
Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of… (More)
  • table 1
Is this relevant?
2011
2011
In an earlier paper, the author adapted to Parsing Expression Grammars (PEGs) the properties FIRST and FOLLOW used in the… (More)
Is this relevant?
2009
2009
The paper is an attempt to see how much we can learn about a given Parsing Expression Grammar with the help of classical concepts… (More)
Is this relevant?
2008
2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular… (More)
  • table 1
Is this relevant?