Construct · 1 fields · 1 citations

parsing expression grammar: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
parsingexpression grammar1 CONSTRUCTParsing expressionFORD · PROGRAMMING LANGUAGES

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Programming languages

a recognition-based grammar formalism with ordered choice and lookahead that is never ambiguous and can be parsed in linear time with memoization.

In programming languages, parsing expression grammar refers to a recognition-based grammar formalism with ordered choice and lookahead that is never ambiguous and can be parsed in linear time with memoization. This meaning comes from Ford (2004) in Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how parsing expression grammar sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

expression4 fields · 4 citationsjingle · one word, four constructsgrammar4 fields · 4 citationsjingle · one word, four constructsmemoization1 fields · 1 citationsanchor · a standalone construct

References

  1. Ford, B. (2004). Parsing expression grammars: a recognition-based syntactic foundation. Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/964001.964011

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct