Results 11 to 20 of about 127,422 (77)
, 2014 Packrat parsing is a top-down, recursive descent parsing technique that uses backtracking and has a guaranteed linear parse time. Conventional backtracking parsers suffer from exponential parse times in the worst case due to re-evaluating redundant results. This is avoided in packrat parsers with the use of memoization.
Flodin, Daniel
core +4 more sources
Deductive parsing with interaction grammars [PDF]
, 2009 We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving ...
Joseph Le Roux, Le Roux, Joseph
core +4 more sources
PoC Implementation of parser generators based on existing/SG/CM-stateful packrat parsing
, 2020 This is an artifact of the paper titled "Is Stateful Packrat Parsing Really Linear in Practice? -- A Counter-Example, an Improved Grammar, and Its Parsing Algorithms --".
Chida, Nariyoshi +1 more
core +2 more sources
Parsing of partially bracketed structures for parse selection [PDF]
, 2012 We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars.
S´anchez-S´aez, Ricardo +1 more
core +2 more sources
Weighted parsing of trees [PDF]
, 2011 We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars.
Nederhof, Mark Jan
core +3 more sources
Fast, Flexible, and Declarative Construction of Abstract Syntax Trees with PEGs [PDF]
Journal of Information Processing, 2015 We address a declarative construction of abstract syntax trees with Parsing Expression Grammars. AST operators (constructor, connector, and tagging) are newly defined to specify flexible AST constructions.
Kimio Kuramitsu
semanticscholar +1 more source
Implementation of C Library for Constructing Packrat Parser with Statically Allocated Memory
Journal of Information Processing, 2018 Packrat parsing is a recursive descent parsing method with backtracking and memoization. Parsers based on this method require no separate lexical analyzers, and backtracking enables those parsers to handle a wide range of complex syntactic constructs ...
Yuta Sugimoto, Atusi Maeda
semanticscholar +1 more source
Pyramid Scene Parsing Network [PDF]
Computer Vision and Pattern Recognition, 2016 Scene parsing is challenging for unrestricted open vocabulary and diverse scenes. In this paper, we exploit the capability of global context information by different-region-based context aggregation through our pyramid pooling module together with the ...
Hengshuang Zhao +4 more
semanticscholar +1 more source
Parsing multi-ordered grammars with the Gray algorithm
PeerJ Preprints, 2019 Background. Context-free grammars (CFGs) and Parsing-expression Grammars (PEGs) are the two main formalisms used by formal specifications and parsing frameworks to describe programming languages.
Nick Papoulias
semanticscholar +1 more source
CoRR, 2020 A recursive descent parser is built from a set of mutually-recursive functions, where each function directly implements one of the nonterminals of a grammar. A packrat parser uses memoization to reduce the time complexity for recursive descent parsing from exponential to linear in the length of the input.
openaire +2 more sources