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.

GitHub

366 stars
21 watching
24 forks
Language: Haskell
last commit: over 3 years ago

Related projects:

RepositoryDescriptionStars
haskell/parsecA parser combinator library designed to be industrial-strength and easy to use850
famished-tiger/rleyA Ruby library for parsing context-free languages using the Earley algorithm37
jcolag/thueA language and runtime system for parsing arbitrary grammars using semi-Thue processes29
shnewto/bnfA parser for Backus-Naur form grammars in Rust.262
egonschiele/handsomesoupA Haskell library that simplifies HTML parsing by providing CSS selectors and attribute extraction functions.123
lettier/parsing-with-haskell-parser-combinatorsAn in-depth guide to parsing using Haskell's parser combinator technology93
askeladdk/prattleA parser and scanner package for LL(1) grammars7
guibou/pyfA Haskell library for string formatting with a mini language inspired by Python's printf.66
kowey/geniA surface realiser using Tree Adjoining Grammar for Natural Language Generation, implemented in Haskell.21
aappleby/matcheroniA minimalist C++20 library for building pattern-matchers and parsers using Parsing Expression Grammars (PEGs)198
haskell/binaryEfficient serialisation of values to and from lazy ByteStrings in Haskell.109
haskell/attoparsecA fast parser combinator library for efficient text parsing in network protocols and file formats513
tlehman/fenparserA parser for encoding chess positions using Forsyth-Edwards Notation.15
alexflint/go-argProvides a structured approach to parsing command-line arguments in Go2,046
tanakh/peggyA parser generator for Haskell that focuses on simplicity and conciseness while providing fast and modern parsing capabilities93