Results 51 to 60 of about 147 (106)
Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle [PDF]
, 2014 Tom Ridge
openalex +1 more source
Graph Parser Combinators [PDF]
, 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
openalex +2 more sources
Parser Combinators for Ambiguous Left-Recursive Grammars [PDF]
, 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
Functional-Logic Graph Parser Combinators
, 2008 Parser combinators are a popular technique among functional programmers for writing parsers. They allow the definition of parsers for string languages in a manner quite similar to BNF rules. In recent papers we have shown that the combinator approach is also beneficial for graph parsing.
Steffen Mazanek, Mark Minas
openalex +3 more sources
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
Electronic Communication of The European Association of Software Science and Technology, 2008 Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domain of string languages so-called parser combinators are very popular for writing efficient parsers.
Steffen Mazanek, Mark Minas
openalex +3 more sources
Deterministic, error-correcting combinator parsers
, 1996 We show how error-correcting, deterministic, combinator parsers can be constructed for grammars which have the LL(1) property. The normal disadvantages of conventional combinator parsers, such as their lack of speed and their poor error reporting, are remedied.
S. Doaitse Swierstra, Luc Duponcheel
openalex +4 more sources
Fast, Error Correcting Parser Combinators: A Short Tutorial
, 1999 Compiler writers have always heavily relied on tools: parser generators for generating parsers out of context free grammars, attribute grammar systems for generating semantic analyzers out of attribute grammars, and systems for generating code generators out of descriptions of machine architectures.
S. Doaitse Swierstra +1 more
openalex +4 more sources
Syntax Error Search Using Parser Combinators [PDF]
2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus), 2021 Parser combinators is a popular approach to parsing sequences generated by context-free grammars, which can be specialized data formats (e.g. JSON, YAML), markup languages like XML or HTML. At the same time, this approach is rarely used for parsing programming languages.The purpose of this paper is to study the application of parser combinators for ...
Georgii Firsov, Mikhail Kuznetsov
openaire +1 more source
Total parser combinators [PDF]
ACM SIGPLAN Notices, 2010 A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is similar to those of many other parser combinator libraries, with two important differences: one is that the interface clearly specifies which parts of the constructed parsers may be ...
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 11th edition of the International Workshop on Smalltalk Technologies, 2016
Parser combinators are a popular approach to parsing. Parser combinators follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, their universality and flexibility introduces a noticeable performance overhead.
Jan Vraný +4 more
openaire +2 more sources
Parser combinators are a popular approach to parsing. Parser combinators follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, their universality and flexibility introduces a noticeable performance overhead.
Jan Vraný +4 more
openaire +2 more sources