Results 61 to 70 of about 17,493 (90)
Semantic composition of robotic solver algorithms on graph structures. [PDF]
Front Robot AISchneider S +2 more
europepmc +1 more source
Practicality of parser combinators
Sintaksni analizatorji so ključno orodje za pretvorbo programske ali podatkovno opisne kode v računalnikom razumljivo obliko. Zgradimo jih lahko z različnimi metodami in pristopi analize.
GOLJAT, DAVID
core
A Practical Parser with Combined Parsing Techniques
International Journal of Software Engineering & Applications, 2015 openaire +1 more source
Optimizing Parser Combinators [PDF]
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.
Mohammad Ghafari +2 more
exaly +7 more sources
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
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Lecture Notes in Computer Science, 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.
Mark Minas
exaly +3 more sources
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.
Mark Minas
exaly +3 more sources
Functional-Logic Graph Parser Combinators
Lecture Notes in Computer Science, 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.
Mark Minas
exaly +3 more sources
Parser combinators for context-free path querying
Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, 2018Transparent 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.
Semyon Grigorev
exaly +3 more sources