Parsing expression grammar: Difference between revisions

Content deleted Content added
Definition: Added top of section
Syntax: Abstract versus concrete syntax
Line 34:
 
=== Syntax ===
Both ''abstract'' and ''concrete'' syntaxes of parsing expressions are seen in the literature, and in this article. The abstract syntax is essentially a mathematical formula and primarily used in theoretical contexts, whereas concrete syntax parsing expressions could be used directly to control a [[parser]]. The primary concrete syntax is that defined by Ford<ref name="For04"/>{{rp|Fig.1}}, although many tools have their own dialect of this. Other tools<ref>{{cite web |last1=Sirthias |first1=Mathias |title=Parboiled: Rule Construction in Java |url=https://github.com/sirthias/parboiled/wiki/Rule-Construction-in-Java |access-date=13 January 2024}}</ref> can be closer to using a programming-language native encoding of abstract syntax parsing expressions as their concrete syntax.
 
Formally, a parsing expression grammar consists of:
* A finite set ''N'' of ''[[nonterminal symbol]]s''.