Marpa and nullable symbols

03/07/2023
by   Jeffrey Kegler, et al.
0

The Marpa parser was intended to make the best results in the academic literature on Earley's algorithm available as a practical general parser. Earley-based parsers have had issues handling nullable symbols. Initially, we dealt with nullable symbols by following the approach in Aycock and Horspool's 2002 paper. This paper reports our experience with the approach in that paper, and the approach to handling nullables that we settled on in reaction to that experience.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2018

On the number of symbols that forces a transversal

Akbari and Alipour conjectured that any Latin array of order n with at l...
research
10/30/2020

Lake symbols for island parsing

Context: An island parser reads an input text and builds the parse (or a...
research
10/31/2018

Exceptionally Monadic Error Handling

We notice that the type of src_haskellcatch :: c a -> (e -> c a) -> c a ...
research
03/27/2013

Handling uncertainty in a system for text-symbol context analysis

In pattern analysis, information regarding an object can often be drawn ...
research
06/02/2017

Efficient Textual Representation of Structure

This paper attempts a more formal approach to the legibility of text bas...
research
09/07/2021

Congruence Closure Modulo Permutation Equations

We present a framework for constructing congruence closure modulo permut...
research
01/20/2021

Communication Aid for Non-English Speaking Newcomers

This research work is intended to assess the usability of Pictogram symb...

Please sign up or login with your details

Forgot password? Click here to reset