Results 81 to 90 of about 13,549 (110)
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.
Swierstra, S.D., Duponcheel, L.C.S.
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Jparsec - a parser combinator for Javascript [PDF]
, 2023 Parser combinators have been a popular parsing approach in recent years. Compared with traditional parsers, a parser combinator has both readability and maintenance advantages.
Zhong, Sida
openaire +2 more sources
1999
Parser combinators enable the construction of recursive descent parsers in a very clear and simple way. Unfortunately, the resulting parsers have a polynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude using continuations.
Pieter W. M. Koopman +1 more
openaire +2 more sources
Parser combinators enable the construction of recursive descent parsers in a very clear and simple way. Unfortunately, the resulting parsers have a polynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude using continuations.
Pieter W. M. Koopman +1 more
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Functional-Logic Graph Parser Combinators
2008Parser 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
openaire +2 more sources
Parser combinators for context-free path querying
Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, 2018Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general-purpose programming language as well as static checking of errors in queries may greatly simplify the development of applications using CFPQs.
Ekaterina Verbitskaia +3 more
openaire +2 more sources
Parser Combinators for Ambiguous Left-Recursive Grammars
2007Parser 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 A. Frost +2 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 ...
Maytham Alabbas, Allan Ramsay
openaire +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