Difference between revisions of "Frown"
Jump to navigation
Jump to search
DonStewart (talk | contribs) (Stub for Frown) |
(Added links and updated one) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
== Frown == |
== Frown == |
||
| − | [[Category:Compiler |
+ | [[Category:Compiler tools]] |
Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98. |
Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98. |
||
| Line 8: | Line 8: | ||
* Time and space efficient |
* Time and space efficient |
||
| − | * The parsers are purely functional, table-free parsers, with |
+ | * The parsers are purely functional, table-free parsers, with states encoded via mutually recursive functions |
| − | For more information |
+ | For more information: |
| + | * [http://www.cs.ox.ac.uk/ralf.hinze/frown/ The Frown site]. |
||
| + | * Slides from a talk about Frown: [http://www.cs.ox.ac.uk/people/ralf.hinze/talks/Frown.pdf FROWN An LALR(k) Parser Generator] (PDF) |
||
| + | |||
| + | The source code can be found at [https://github.com/strake/frown GitHub] |
||
{{Template:Stub}} |
{{Template:Stub}} |
||
Latest revision as of 21:22, 29 August 2014
Frown
Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98.
Its main features:
- Time and space efficient
- The parsers are purely functional, table-free parsers, with states encoded via mutually recursive functions
For more information:
- The Frown site.
- Slides from a talk about Frown: FROWN An LALR(k) Parser Generator (PDF)
The source code can be found at GitHub
This article is a stub. You can help by expanding it.