Add to ORKGIn a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar's recursion, decoupling the grammar from its semantic actions and making semantic actions independent of matching order. In this technical report, we present the implementation of some interesting grammar algorithms in order to provide evidence for the increased power and declarative style of our novel grammar representation. The presented code is a simplification of parts of our freely available Haskell library grammar-combinators.nrpages: 21status: publishe
Investigated various parsing algorithms and grammar models and applied this knowledge in the design ...
Algorithms are developed which construct from a given LL(l) grammar a recursive descent parser with ...
AbstractThis paper deals with the problem of computing relations from their abstract non-algorithmic...
We propose a novel context-free grammar representation for parsing libraries in a pure programming l...
Abstract. Parser combinators are higher-order functions used to build parsers as executable specific...
Abstract. Parser combinators are higher-order functions used to build parsers as executable specific...
Parsers for context-free grammars can be implemented directly and naturally in a functional style kn...
We define a finally tagless, shallow embedding of a typed grammar language. In order to avoid the li...
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, an...
This article describes a compiler generator, called Mímico, that outputs code based on the use of mo...
This article describes a compiler generator, called Mímico, that outputs code based on the use of mo...
In a recent paper, Launchbury, Lewis, and Cook observe that some Haskell applications could benefit ...
Monads have become a popular tool for dealing with computational effects in Haskell for two signific...
The recovery of structure from flat sequences of input data is a problem that almost all programs ne...
The recovery of structure from flat sequences of input data is a problem that almost all programs ne...
Investigated various parsing algorithms and grammar models and applied this knowledge in the design ...
Algorithms are developed which construct from a given LL(l) grammar a recursive descent parser with ...
AbstractThis paper deals with the problem of computing relations from their abstract non-algorithmic...
We propose a novel context-free grammar representation for parsing libraries in a pure programming l...
Abstract. Parser combinators are higher-order functions used to build parsers as executable specific...
Abstract. Parser combinators are higher-order functions used to build parsers as executable specific...
Parsers for context-free grammars can be implemented directly and naturally in a functional style kn...
We define a finally tagless, shallow embedding of a typed grammar language. In order to avoid the li...
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, an...
This article describes a compiler generator, called Mímico, that outputs code based on the use of mo...
This article describes a compiler generator, called Mímico, that outputs code based on the use of mo...
In a recent paper, Launchbury, Lewis, and Cook observe that some Haskell applications could benefit ...
Monads have become a popular tool for dealing with computational effects in Haskell for two signific...
The recovery of structure from flat sequences of input data is a problem that almost all programs ne...
The recovery of structure from flat sequences of input data is a problem that almost all programs ne...
Investigated various parsing algorithms and grammar models and applied this knowledge in the design ...
Algorithms are developed which construct from a given LL(l) grammar a recursive descent parser with ...
AbstractThis paper deals with the problem of computing relations from their abstract non-algorithmic...