Results 11 to 20 of about 1,131 (104)

Monadic Parser Combinators [PDF]

, 1996
In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition.
Hutton, G., Meijer, H.J.M.
core   +10 more sources

Mímico: a monadic combinator parser generator [PDF]

Journal of the Brazilian Computer Society, 2003
This article describes a compiler generator, called Mimico, that outputs code based on the use of monadic combinators. Mimico can parse infinite look-ahead and left-recursive context free grammars and defines a scheme for handling the precedence and associativity of binary infix operators, and monadic code in semantic rules. Mimico provides an easy way
Camarão, Carlos, Figueiredo, Lucilia, Rodrigues, Hermann   +2 more
openaire   +5 more sources

Lazy Functional Parser Combinators in Java [PDF]

, 2001
A parser is a program that checks if a text is a sentence of the language as described by a grammar. Traditionally, the program text of a parser is generated from a grammar description, after which it is compiled and subsequently run. The language accepted by such a parser is, by the nature of this process, hardcoded in the program.
Swierstra, D.S., Dijkstra, A.
openaire   +5 more sources

Combinator Parsers: From Toys to Tools

Electronic Notes in Theoretical Computer Science, 2001
AbstractWe develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the parsers constructed “analyze themselves”.
Doaitse Swierstra
openaire   +4 more sources

Automatic definition extraction using parser combinators [PDF]

, 2008
The automatic extraction of definitions from natural language texts has various applications such as the creation of glossaries and question-answering systems. In this paper we look at the extraction of definitions from non-technical texts using parser combinators in Haskell.
Borg, Claudia, Pace, Gordon J., University of Malta Workshop in ICT (WICT'08)   +2 more
openaire   +3 more sources

Ramble: Parser Combinator for R

The Journal of Open Source Software, 2017
Chapman Siu
openaire   +3 more sources

Memoizing a monadic mixin DSL [PDF]

, 2011
Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features.
Samulowitz, Horst, Schrijvers, Tom, Stuckey, Peter, Tack, Guido, Wuille, Pieter   +4 more
core   +1 more source

Action semantics in retrospect [PDF]

, 2009
This paper is a themed account of the action semantics project, which Peter Mosses has led since the 1980s. It explains his motivations for developing action semantics, the inspirations behind its design, and the foundations of action semantics based on ...
D.A. Watt, D.F. Brown, G. Kahn, J. Backus, J. Palsberg, K.-G. Doh, P. Ørbæk, P.D. Mosses, P.D. Mosses, P.D. Mosses, P.D. Mosses, P.D. Mosses, P.D. Mosses, S. Even   +13 more
core   +1 more source

How functional programming mattered [PDF]

, 2015
In 1989 when functional programming was still considered a niche topic, Hughes wrote a visionary paper arguing convincingly ‘why functional programming matters’. More than two decades have passed. Has functional programming really mattered? Our answer is
Abelson, Armstrong, Armstrong, Arts, Arts, Axelsson, Baars, Backus, Bahr, Barthe, Bertot, Bird, Bird, Bird, Bird, Bird RS Moor, Blelloch, Blelloch, Bringert, Carette, Chakravarty, Chakravarty MMT Leshchinskiy, Chetali, Chin, Claessen, Claessen, Cole, Cole, de Moor, Dean, Devriese, Dijkstra, Dybvig, Elliott, Elliott, Epstein, Farmer, Fegaras, Felleisen, Ford, Gibbons, Gibbons, Gill, Halloway, Hammond, Hansen MR Rischel, Harris, Hinze, Hinze, Hu, Hu, Hu, Hu, Hu, Hudak, Hudak, Hudak, Hudak, Hudak, Hudak, Hughes, Hughes, Hughes, Hughes JM Bolinder, Hutton, Hutton, Jones, Katayama, Katayama, Kiselyov, Launchbury, Launchbury, Leijen, Leroy, Liang, Lindley, Loidl HW Rubio, Matsuzaki, Mcbride, Meijer, Meijer, Milner, Minsky, Minsky, Moggi, Moggi, Morita, Mu, Naiman, Norell, Odersky, Oliveira BCS Moors, Paterson, Paulson, Persson, Peyton Jones, Peyton Jones, Peyton Jones SL Wadler, Reynolds, Sagonas, Schrijvers, Sculthorpe, Seibel, Sheard, Skillicorn, Smith, Snyder, Steele, Steele, Svenningsson, Svenningsson, Swierstra, Swierstra SD Duponcheel, Takano, Takano, Tesson, Wadler, Wadler, Wadler, Wadler, Wampler, Yang   +121 more
core   +1 more source

Accelerating parser combinators with macros [PDF]

Proceedings of the Fifth Annual Scala Workshop, 2014
Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used for composition introduce substantial overhead, which leads to poor performance.In this paper, we ...
Eric Béguet, Manohar Jonnalagedda
openaire   +1 more source