Results 71 to 80 of about 13,549 (110)

cheminfo/arraybuffer-xml-parser: v0.6.1

open access: yes
<h2><a href="https://github.com/cheminfo/arraybuffer-xml-parser/compare/v0.6.0...v0.6.1">0.6.1</a> (2024-05-14)</h2> <h3>Bug Fixes</h3> <ul> <li>update dependencies (<a href="https://github.com/cheminfo ...
cheminfo-bot   +3 more
core   +1 more source

Bellman's GAP--a language and compiler for dynamic programming in sequence analysis. [PDF]

open access: yesBioinformatics, 2013
Sauthoff G   +3 more
europepmc   +1 more source

Predictive parser combinators need four values to report errors

open access: yes, 1996
A combinator-based parser is a parser constructed directly from a BNF grammar, using higher-order functions (combinators) to model the alternative and sequencing operations of BNF.
Partridge, AS (15475826)   +1 more
core  

Meerkat parsers: a general parser combinator library for real programming languages

open access: yes, 2015
Izmaylova, Anastasia   +3 more
core  

A Practical Parser with Combined Parsing Techniques

open access: yesInternational Journal of Software Engineering & Applications, 2015
openaire   +1 more source

Optimizing Parser Combinators [PDF]

open access: yesProceedings 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

Total parser combinators

open access: yesACM 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   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

DSL and Parser Combinator

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

Home - About - Disclaimer - Privacy