Results 101 to 110 of about 82,171 (148)
Parser Combinators for Ambiguous Left-Recursive Grammars
, 2007 Parser combinators are higher-order functions used to build parsers as executable specifications of grammars. Some existing implementations are only able to handle limited ambiguity, some have exponential time and/or space complexity for ambiguous input, most cannot accommodate left-recursive grammars.
Richard Frost +2 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
InDubio: A Combinator Library to Disambiguate Ambiguous Grammars
Communication Systems and Applications, 2020To infer an abstract model from source code is one of the main tasks of most software quality analysis methods. Such abstract model is called Abstract Syntax Tree and the inference task is called parsing.
José Nuno Macedo, J. Saraiva
semanticscholar +1 more source
Oregano: staging regular expressions with Moore Cayley fusion
ACM SIGPLAN Symposium/Workshop on Haskell, 2022Regular expressions are a tool for recognising regular languages, historically implemented using derivatives or non-deterministic finite automata. They are convenient for many light-weight parsing workloads, but their traditional formulation only lends ...
Jamie Willis, Nicolas Wu, Tom Schrijvers
semanticscholar +1 more source
2008
A graph language can be described by a graph grammar in a manner similar to a string grammar known from the theory of formal languages. Unfortunately, graph parsing is known to be computationally expensive in general. There are quite simple graph languages that crush most general-purpose graph parsers.
Steffen Mazanek, Mark Minas
openaire +1 more source
A graph language can be described by a graph grammar in a manner similar to a string grammar known from the theory of formal languages. Unfortunately, graph parsing is known to be computationally expensive in general. There are quite simple graph languages that crush most general-purpose graph parsers.
Steffen Mazanek, Mark Minas
openaire +1 more source
Modeling and implementation of context free grammar combinatorial parser
Proceedings of the Southwest State University. Series: IT Management, Computer Science, Computer Engineering. Medical Equipment EngineeringThe purpose of the research is to model and implement a system of functions and combinators for parsing languages that can be defined using context-free grammars, as well as to reduce the source code of the parsing program. Methods.
A. A. Chaplygin
semanticscholar +1 more source
Exploring Zero-Shot Prompting for Generating Data Format Descriptions
2025 IEEE Security and Privacy Workshops (SPW)Parsers validate and process untrusted user input and transform it into data structures that provide easier access. Software engineers either build these parsers for data formats from scratch or leverage libraries targeting specific formats.
Prashant Anantharaman +1 more
semanticscholar +1 more source
Invertible Syntax without the Tuples (Functional Pearl)
arXiv.orgIn the seminal paper Functional unparsing, Olivier Danvy used continuation passing to reanalyse printf-like format strings as combinators. In the intervening decades, the conversation shifted towards a concurrent line of work --- applicative, monadic or ...
Mathieu Boespflug, A. Spiwack
semanticscholar +1 more source
Combining Analyses from Various Parsers
2000This chapter describes measures implemented in the semantics module to ensure that best use is made of the available linguistic analyses.
C. J. Rupp +3 more
openaire +1 more source
Improved Parsing for Arabic by Combining Diverse Dependency Parsers
2014Recently there has been a considerable interest in dependency parsing for many reasons. First, it works accurately for a wide range of typologically different languages. Second, it can be useful for semantics, since it can be easier to attach compositional rules directly to lexical items than to assign them to large numbers of phrase structure rules ...
Alabbas, Maytham, Ramsay, Allan
openaire +1 more source