Results 111 to 120 of about 296,979 (166)
, 2012 This paper presents an ensemble system for dependency parsing: three parsers are separately trained and combined by means of a majority vote. The three parsers are (1) the MATE parser [http://code.google.com/p/mate-tools/], (2) the DeSR parser [http://sites.google.com/site/desrparser/], and (3) the MALT parser [http://maltparser.org/].
MAZZEI, Alessandro, BOSCO, CRISTINA
openaire +1 more source
Functional-Logic Graph Parser Combinators
International Conference on Rewriting Techniques and Applications, 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.
Mark Minas, Steffen Mazanek
semanticscholar +4 more sources
Deterministic, error-correcting combinator parsers
Advanced Functional Programming, 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.
Luc Duponcheel, S. Doaitse Swierstra
semanticscholar +5 more sources
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 ...
Nils Anders Danielsson
openaire +2 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 +2 more sources
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 +3 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 +3 more sources
Beginning Scala 3, 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
David Pollak, Vishal Layka
openaire +3 more sources
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
David Pollak, Vishal Layka
openaire +3 more sources
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
openaire +2 more sources
International Symposium on Implementation and Application of Functional Languages, 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 Koopman, Marinus J. Plasmeijer
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 Koopman, Marinus J. Plasmeijer
openaire +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 A. Frost +2 more
openaire +2 more sources