384 Hits in 3.7 sec

Speeding up Generalized PSR Parsers by Memoization Techniques

Mark Minas
2019 Electronic Proceedings in Theoretical Computer Science  
To overcome this restriction, we have recently extended PSR parsing to generalized PSR (GPSR) parsing along the lines of Tomita-style generalized LR parsing.  ...  But memoization techniques do not help when parsing invalid graphs or if all parses of an ambiguous input graph shall be determined.  ...  It tries to save time and space in a similar way as Tomita-style GLR parsers for context-free string grammars. Let us briefly summarize how GPSR parsing works.  ... 
doi:10.4204/eptcs.309.4 fatcat:6ght5lgrgncsvnf5cunnczm4dy

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle [chapter]

Tom Ridge
2014 Lecture Notes in Computer Science  
Previous work introduced novel parser combinators that could be used to parse all context-free grammars.  ...  The result is a sound-and-complete combinator parsing library that can handle all context-free grammars, and has good performance.  ...  E "1111111" − : int list = [7] 8 Context and memoization Parsing context, introduced in [13] , forces all top-down parse attempts to terminate, which means that arbitrary context-free grammars, such  ... 
doi:10.1007/978-3-319-11245-9_15 fatcat:m7phkbdbljfpxnaxsomf7p4be4

Better extensibility through modular syntax

Robert Grimm
2006 SIGPLAN notices  
and parsing, offer an attractive alternative to context-free grammars.  ...  through aggressive optimizations.  ...  for context-free grammars.  ... 
doi:10.1145/1133255.1133987 fatcat:4o2xszurz5anvihlmuzsmovbzm

Better extensibility through modular syntax

Robert Grimm
2006 Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06  
and parsing, offer an attractive alternative to context-free grammars.  ...  through aggressive optimizations.  ...  for context-free grammars.  ... 
doi:10.1145/1133981.1133987 dblp:conf/pldi/Grimm06 fatcat:m67afl4brnfm5eka3yafnwgi3e

Parsing Expression Grammars Made Practical [article]

Nicolas Laurent, Kim Mens
2015 arXiv   pre-print
We also explore the extensibility of the PEG paradigm by showing how one can easily introduce new parsing operators and how our parser accommodates custom memoization and error handling strategies.  ...  Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them.  ...  Most of the work on parsing has been built on top of Chomsky's context-free grammars (CFGs).  ... 
arXiv:1509.02439v1 fatcat:3yvvebmm4vccpph7j3rarswlvq

Implementation of C Library for Constructing Packrat Parser with Statically Allocated Memory

Yuta Sugimoto, Atusi Maeda
2018 Journal of Information Processing  
Packrat parsing is a recursive descent parsing method with backtracking and memoization.  ...  Parsing time compared to other systems when parsing JavaScript Object Notation and Java source files are given.  ...  Unlike context-free grammars, PEG is characterized by ordered choice operator /, which prioritizes alternatives.  ... 
doi:10.2197/ipsjjip.26.335 fatcat:aeyvm2up65duhlqgylro2ifvyi

A tabulation-based parsing method that reduces copying

Gerald Penn, Cosmin Munteanu
2003 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03  
This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) per edge.  ...  The particular interest in Prolog's expressiveness arises, of course, from the interest in generalized context-free parsing beginning with definite clause grammars (Pereira and Shieber, 1987) , as an  ...  For classical context-free grammars, the category information that must be copied is normally quite small in size.  ... 
doi:10.3115/1075096.1075122 dblp:conf/acl/PennM03 fatcat:ud5zxigewvhxfkhmiz65ntfhim

Relational parsing: a clean, fast parsing strategy for all context-free languages [article]

Grzegorz Herman
2019 arXiv   pre-print
We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network.  ...  common generalized parsing algorithms, in some cases by orders of magnitude.  ...  We present a new generalized context-free parsing algorithm which we call relational parsing.  ... 
arXiv:1902.06591v1 fatcat:afx3olo7e5fk7bxaih25zbuk4q

Packrat parsers can handle practical grammars in mostly constant space

Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
2010 Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '10  
Experiments showed that parsers generated from cut-inserted grammars can parse Java programs and subset XML files in bounded space.  ...  Packrat parsing is a powerful parsing algorithm presented by Ford in 2002.  ...  PEGs can express all deterministic LR(k) languages and some non-context-free languages [9] . Packrat Parsing Packrat parsing is a parsing algorithm that was first presented by Ford [8] .  ... 
doi:10.1145/1806672.1806679 dblp:conf/paste/MizushimaMY10 fatcat:f37aznrryjaulnhtd5gqufqr44

Pika parsing: reformulating packrat parsing as a dynamic programming algorithm solves the left recursion and error recovery problems [article]

Luke A. D. Hutchison
2020 arXiv   pre-print
A packrat parser uses memoization to reduce the time complexity for recursive descent parsing from exponential to linear in the length of the input.  ...  Pika parsing maintains the linear-time performance characteristics of packrat parsing as a function of input length.  ...  It can parse any context-free grammar, including left-recursive grammars.  ... 
arXiv:2005.06444v4 fatcat:t3b5n6nqbvc53gezitsxngsqri

The formalization and implementation of Adaptable Parsing Expression Grammars

Leonardo V.S. Reis, Roberto S. Bigonha, Vladimir O. Di Iorio, Luis Eduardo S. Amorim
2014 Science of Computer Programming  
h i g h l i g h t s • We propose an adaptable model based on Parsing Expression Grammars. • We added attributes to PEG so extensibility is achieved by means of grammar attributes. • The model is formally  ...  Wegbreit proposed Extensible Context Free Grammars (ECFGs), consisting of a context free grammar together with a finite state transducer.  ...  For example, Ford created Parsing Expression Grammars (PEG) [1] , an alternative to Context Free Grammars for describing syntax, and packrat parsers [2] , top-down parsers with backtracking that allow  ... 
doi:10.1016/j.scico.2014.02.020 fatcat:iqhdlprtrfcvxc4na33mif3vm4

Marpa, A practical general parser: the recognizer [article]

Jeffrey Kegler
2019 arXiv   pre-print
Marpa is a practical and fully implemented algorithm for the recognition, parsing and evaluation of context-free grammars.  ...  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.  ...  For a context-free grammar, and a parse location Proof.  ... 
arXiv:1910.08129v1 fatcat:2a6usemamfgl7bogfwyreqpdwm

Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs [article]

Heike Stephan
2014 arXiv   pre-print
My research goal is to employ a parser generation algorithm based on the Earley parsing algorithm to the evaluation and compilation of queries to logic programs, especially to deductive databases.  ...  By means of partial deduction, from a query to a logic program a parameterized automaton is to be generated that models the evaluation of this query.  ...  The rich knowledge of parser generation is thus of great value for the task of compiling queries to logic programs: A parser for a deterministic context-free language can move through a word and decide  ... 
arXiv:1405.3826v1 fatcat:45s7ighu4natvdnptoof5gg6ry

Simplified Parsing Expression Derivatives [article]

Aaron Moss
2018 arXiv   pre-print
This paper presents a new derivative parsing algorithm for parsing expression grammars; this new algorithm is both simpler and faster than the existing parsing expression derivative algorithm presented  ...  This linear time bound also suggests that some context-free languages cannot be recognized by a PEG, as the best known general-purpose CFG parsing algorithms have cubic worst-case time.  ...  It is conjectured, however, that context-free languages exist that cannot be recognized by a PEG.  ... 
arXiv:1808.08893v1 fatcat:uhob4bukybfk5dyuqxysfmfmxe

Nez: practical open grammar language

Kimio Kuramitsu
2016 Proceedings of the 2016 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software - Onward! 2016  
in packrat parsing.  ...  In Nez, we extend the symbol-based state management to recognize context-sensitive language syntax, which often appears in major programming languages.  ...  Acknowledgments The C version of Nez parsers (cnez and virtual parsing machines) have been developed by Masahiro Ide and Shun Honda.The JavaScript version has been developed by Takeru Sudo.  ... 
doi:10.1145/2986012.2986019 dblp:conf/oopsla/Kuramitsu16 fatcat:uxestroeh5br5mle4bmybbal2e
« Previous Showing results 1 — 15 out of 384 results