Results 61 to 70 of about 127,422 (77)
Some of the next articles are maybe not open access.
Software Language Engineering, 2021
Incremental parsing is an integral part of code analysis performed by text editors and integrated development environments. This paper presents new methods to significantly improve the efficiency of incremental parsing for Parsing Expression Grammars ...
Zachary Yedidia, Stephen Chong
semanticscholar +1 more source
Incremental parsing is an integral part of code analysis performed by text editors and integrated development environments. This paper presents new methods to significantly improve the efficiency of incremental parsing for Parsing Expression Grammars ...
Zachary Yedidia, Stephen Chong
semanticscholar +1 more source
ACM SIGPLAN Notices, 2017
We present a novel but remarkably simple formulation of formal language grammars in Haskell as functions mapping a record of pro- duction parsers to itself. Thus formulated grammars are first-class objects, composable and reusable. We also provide a simple parser implementation for them, based on an improved packrat algorithm.
Mario Blažević, Jacques Légaré
openaire +1 more source
We present a novel but remarkably simple formulation of formal language grammars in Haskell as functions mapping a record of pro- duction parsers to itself. Thus formulated grammars are first-class objects, composable and reusable. We also provide a simple parser implementation for them, based on an improved packrat algorithm.
Mario Blažević, Jacques Légaré
openaire +1 more source
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Fundamenta Informaticae, 2007 Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in terms of recognizing strings, rather than constructing them.
Roman R. Redziejowski
semanticscholar +2 more sources
Packrat parsers can support left recursion
, 2008 Packrat parsing offers several advantages over other parsing techniques, such as the guarantee of linear parse times while supporting backtracking and unlimited look-ahead.
Alessandro Warth +3 more
exaly +1 more source
A Fundamental Algorithm for Dependency Parsing (With Corrections)
arXiv.orgThis paper presents a fundamental algorithm for parsing natural language sentences into dependency trees. Unlike phrase-structure (constituency) parsers, this algorithm operates one word at a time, attaching each word as soon as it can be attached ...
M. Covington
semanticscholar +1 more source
Parsing Expression Grammar and Packrat Parsing—A Review
2022Nikhil S. Mangrulkar +2 more
openaire +1 more source
Parsing Expression Grammar and Packrat Parsing—A Review
Lecture Notes in Networks and Systems, 2023Nikhil Mangrulkar +2 more
exaly
PEG parsing in less space using progressive tabling and dynamic analysis
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2017F. Henglein, U. Rasmussen
semanticscholar +1 more source
Better extensibility through modular syntax
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2006R. Grimm
semanticscholar +1 more source