Results 81 to 90 of about 1,131 (104)

Parser combinators for context-free path querying

Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, 2018
Transparent 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, Ilya Kirillov, Ilya Nozkin, Semyon Grigorev   +3 more
openaire   +1 more source

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   +2 more sources

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, Rahmatullah Hafiz, Paul Callaghan   +2 more
openaire   +1 more source

Improved Parsing for Arabic by Combining Diverse Dependency Parsers

2014
Recently 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

Combining Dependency Parsers Using Error Rates

2016
In 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

Improving Dependency Analysis by Syntactic Parser Combination

2005 International Conference on Natural Language Processing and Knowledge Engineering, 2006
The goal of this article is to present our work about a combination of several syntactic parsers to produce a more robust parser. We have built a platform which allows us to compare syntactic parsers for a given language by splitting their results in elementary pieces, normalizing them, and comparing them with reference results.
openaire   +1 more source

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.
Swierstra, S.D., Azero Alcocer, P.
openaire   +2 more sources

byteparsing: a functional parser combinator for mixed ASCII/binary data

Journal of Open Source Software, 2023
Johan Hidding, Pablo Rodríguez-Sínchez
exaly  

Novel combinator surface concept for efficiency optimization of ship propulsion system

Ocean Engineering, 2023
Fan Gao, Astrid H. Brodtkorb
exaly  

Design patterns for parser combinators in scala

Proceedings of the Scala Symposium, 2022
Jamie Willis, Nicolas Wu
openaire   +1 more source