Earley
Grammar parser
A Haskell implementation of Earley's algorithm for parsing context-free grammars.
Parsing all context-free grammars using Earley's algorithm in Haskell.
366 stars
21 watching
24 forks
Language: Haskell
last commit: almost 2 years ago Related projects:
Repository | Description | Stars |
---|---|---|
| A parser combinator library designed to be industrial-strength and easy to use | 850 |
| A Ruby library for parsing context-free languages using the Earley algorithm | 37 |
| A language and runtime system for parsing arbitrary grammars using semi-Thue processes | 29 |
| A parser for Backus-Naur form grammars in Rust. | 262 |
| A Haskell library that simplifies HTML parsing by providing CSS selectors and attribute extraction functions. | 123 |
| An in-depth guide to parsing using Haskell's parser combinator technology | 93 |
| A parser and scanner package for LL(1) grammars | 7 |
| A Haskell library for string formatting with a mini language inspired by Python's printf. | 66 |
| A surface realiser using Tree Adjoining Grammar for Natural Language Generation, implemented in Haskell. | 21 |
| A minimalist C++20 library for building pattern-matchers and parsers using Parsing Expression Grammars (PEGs) | 198 |
| Efficient serialisation of values to and from lazy ByteStrings in Haskell. | 109 |
| A fast parser combinator library for efficient text parsing in network protocols and file formats | 513 |
| A parser for encoding chess positions using Forsyth-Edwards Notation. | 15 |
| Provides a structured approach to parsing command-line arguments in Go | 2,046 |
| A parser generator for Haskell that focuses on simplicity and conciseness while providing fast and modern parsing capabilities | 93 |