Results 61 to 70 of about 148 (104)
, 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, Rinus Plasmeijer
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
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 +3 more
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.
Kurs, Jan +4 more
openaire +1 more source
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.
Kurs, Jan +4 more
openaire +1 more source
Syntax Error Search Using Parser Combinators
2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus), 2021Parser 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 ...
Mikhail Kuznetsov, Georgii Firsov
openaire +1 more source
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
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 +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
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 +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