Results 121 to 130 of about 296,979 (166)

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.
Pablo R. Azero Alcocer, S. Doaitse Swierstra   +1 more
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Oregano: staging regular expressions with Moore Cayley fusion

ACM SIGPLAN Symposium/Workshop on Haskell, 2022
Regular expressions are a tool for recognising regular languages, historically implemented using derivatives or non-deterministic finite automata. They are convenient for many light-weight parsing workloads, but their traditional formulation only lends ...
Jamie Willis, Nicolas Wu, Tom Schrijvers
semanticscholar   +1 more source

Certified Parsing of Dependent Regular Grammars

2022 IEEE Security and Privacy Workshops (SPW), 2022
Parsers are ubiquitous, but formal reasoning about the behavior of a parser is challenging. One key challenge is parsing dependent formats, which are difficult for traditional techniques to handle because parse values can influence future parsing ...
J. Sarracino, Gang Tan, Greg Morrisett
semanticscholar   +1 more source

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.
Ilya Nozkin, Ekaterina Verbitskaia, Semyon V. Grigorev, Ilya Kirillov   +3 more
openaire   +2 more sources

Combining Analyses from Various Parsers

2000
This chapter describes measures implemented in the semantics module to ensure that best use is made of the available linguistic analyses.
Karsten L. Worm, C. J. Rupp, Jörg Spilker, Martin Klarner   +3 more
openaire   +2 more sources

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

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

Parser Combinators for Extraction

, 2003
Jan van Eijck
openaire   +2 more sources

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

The sbt-rats parser generator plugin for Scala (tool paper)

SCALA@SPLASH, 2016
A. Sloane, F. Cassez, Scott Buckley
semanticscholar   +1 more source