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.
365 stars
21 watching
24 forks
Language: Haskell
last commit: over 1 year ago Related projects:
| Repository | Description | Stars |
|---|---|---|
 haskell/parsec | A parser combinator library designed to be industrial-strength and easy to use | 847 |
 famished-tiger/rley | A Ruby library for parsing context-free languages using the Earley algorithm | 37 |
 jcolag/thue | A language and runtime system for parsing arbitrary grammars using semi-Thue processes | 29 |
 shnewto/bnf | A parser for Backus-Naur form grammars in Rust. | 260 |
 egonschiele/handsomesoup | A Haskell library that simplifies HTML parsing by providing CSS selectors and attribute extraction functions. | 124 |
 lettier/parsing-with-haskell-parser-combinators | An in-depth guide to parsing using Haskell's parser combinator technology | 92 |
 askeladdk/prattle | A parser and scanner package for LL(1) grammars | 7 |
 guibou/pyf | A Haskell library for string formatting with a mini language inspired by Python's printf. | 66 |
 kowey/geni | A surface realiser using Tree Adjoining Grammar for Natural Language Generation, implemented in Haskell. | 21 |
 aappleby/matcheroni | A minimalist C++20 library for building pattern-matchers and parsers using Parsing Expression Grammars (PEGs) | 198 |
| haskell/binary | Efficient serialisation of values to and from lazy ByteStrings in Haskell. | 106 |
| haskell/attoparsec | A fast Haskell parser combinator library for efficient text and binary data parsing | 513 |
 tlehman/fenparser | A parser for encoding chess positions using Forsyth-Edwards Notation. | 15 |
 alexflint/go-arg | Provides a structured approach to parsing command-line arguments in Go | 2,032 |
 tanakh/peggy | A parser generator for Haskell that focuses on simplicity and conciseness while providing fast and modern parsing capabilities | 93 |