Results 71 to 80 of about 17,493 (90)
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 A. Frost +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Design patterns for parser combinators in scala
Proceedings of the Scala Symposium, 2022Nicolas Wu, Jamie Willis
exaly +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
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
2015
The dichotomy of generic and specific manifests itself in the programming sphere. Domain-specific languages (DSLs) are one of the forms of the manifestations of this dichotomy. Domain-specific languages are just what they are called: domain specific. All programming languages are domain-specific languages when they come into existence, but that changes
Vishal Layka, David Pollak
openaire +1 more source
The dichotomy of generic and specific manifests itself in the programming sphere. Domain-specific languages (DSLs) are one of the forms of the manifestations of this dichotomy. Domain-specific languages are just what they are called: domain specific. All programming languages are domain-specific languages when they come into existence, but that changes
Vishal Layka, David Pollak
openaire +1 more source
Deterministic, error-correcting combinator parsers
1996We 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 +3 more sources
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 ...
Maytham Alabbas, Allan Ramsay
openaire +1 more source
Combining Dependency Parsers Using Error Rates
2016In this paper, we present a method of improving dependency parsing accuracy by combining parsers using error rates. We use four parsers: MSTParser, MaltParser, TurboParser and MateParser, and the data of the analytical layer of the Prague Dependency Treebank.
openaire +1 more source