Marpa, A practical general parser: the recognizer

10/17/2019
by   Jeffrey Kegler, et al.
0

The Marpa recognizer is described. Marpa is a practical and fully implemented algorithm for the recognition, parsing and evaluation of context-free grammars. The Marpa recognizer is the first to unite the improvements to Earley's algorithm found in Joop Leo's 1991 paper to those in Aycock and Horspool's 2002 paper. Marpa tracks the full state of the parse, at it proceeds, in a form convenient for the application. This greatly improves error detection and enables event-driven parsing. One such technique is "Ruby Slippers" parsing, in which the input is altered in response to the parser's expectations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2017

The Meaning Factory at SemEval-2017 Task 9: Producing AMRs with Neural Semantic Parsing

We evaluate a semantic parser based on a character-based sequence-to-seq...
research
07/16/2018

LATE Ain'T Earley: A Faster Parallel Earley Parser

We present the LATE algorithm, an asynchronous variant of the Earley alg...
research
12/12/2018

Systematic Parsing of X.509: Eradicating Security Issues with a Parse Tree

X.509 certificate parsing and validation is a critical task which has sh...
research
12/20/2019

Speeding up Generalized PSR Parsers by Memoization Techniques

Predictive shift-reduce (PSR) parsing for hyperedge replacement (HR) gra...
research
04/11/2023

flap: A Deterministic Parser with Fused Lexing

Lexers and parsers are typically defined separately and connected by a t...
research
05/08/2023

Idris TyRE: a dependently typed regex parser

Regular expressions – regexes – are widely used not only for validating,...
research
11/28/2019

LL(1) Parsing with Derivatives and Zippers

In this paper, we present an efficient, functional, and formally verifie...

Please sign up or login with your details

Forgot password? Click here to reset