This article describes FPG, a functional parser generator. It is functional both in the sense that it is written in, and in the sense that it generates code for, a functional language, in this case LML. The lazy semantics, of the underlying language makes it possible for FPG to accept very general classes of attribute grammars, without the difficulties normally associated with such grammars. these aspects are discussed in the article. The implementation of the parser is also described
This paper argues that a parser generator can be developed that requires less knowledge of parser te...
Lexical Functional Grammar (LFG) is a declarative, constraint-based frame- work for analysing the va...
This paper is intended to provide a set of step by step instructions for using the formalism of Lexi...
This article describes FPG, a functional parser generator. It is functional both in the sense that i...
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both lo...
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, an...
Parser combinators elegantly and concisely model generalised LL parsers in a purely functional langu...
technical reportAn attribute grammar combines the standard context-free grammar that defines the syn...
A parser is a program that checks if a text is a sentence of the language as described by a grammar...
The goal of this thesis is to design and implement a modern parser generator. The result is a progra...
A specification is given for the functional programming language FP using an attribute grammar forma...
Abstract. A parser is a program that checks if a text is a sentence of the language as described by ...
This paper describes the basic architectural concepts that underlie the formal theory of Lexical-Fun...
The SLR(k) Parser Generator discussed in this paper is based upon the automated parser construction ...
'9 ABSTRACT (Continue on reverse if necessary and identify by block number) This thesis present...
This paper argues that a parser generator can be developed that requires less knowledge of parser te...
Lexical Functional Grammar (LFG) is a declarative, constraint-based frame- work for analysing the va...
This paper is intended to provide a set of step by step instructions for using the formalism of Lexi...
This article describes FPG, a functional parser generator. It is functional both in the sense that i...
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both lo...
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, an...
Parser combinators elegantly and concisely model generalised LL parsers in a purely functional langu...
technical reportAn attribute grammar combines the standard context-free grammar that defines the syn...
A parser is a program that checks if a text is a sentence of the language as described by a grammar...
The goal of this thesis is to design and implement a modern parser generator. The result is a progra...
A specification is given for the functional programming language FP using an attribute grammar forma...
Abstract. A parser is a program that checks if a text is a sentence of the language as described by ...
This paper describes the basic architectural concepts that underlie the formal theory of Lexical-Fun...
The SLR(k) Parser Generator discussed in this paper is based upon the automated parser construction ...
'9 ABSTRACT (Continue on reverse if necessary and identify by block number) This thesis present...
This paper argues that a parser generator can be developed that requires less knowledge of parser te...
Lexical Functional Grammar (LFG) is a declarative, constraint-based frame- work for analysing the va...
This paper is intended to provide a set of step by step instructions for using the formalism of Lexi...