tomjridge / tjr_simple_earleyLinks
Simple implementation of a parsing algorithm inspired by Earley
☆15Updated 3 years ago
Alternatives and similar repositories for tjr_simple_earley
Users that are interested in tjr_simple_earley are comparing it to the libraries listed below
Sorting:
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Aurochs is a parser generator that uses the parse expression grammar (PEG) or "packrat" approach. It takes a grammar in a BNF-like notat…☆46Updated 2 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- Ropes ("heavyweight strings") for OCaml☆48Updated last year
- SML Parser Combinator Library☆28Updated 9 years ago
- miniKanren in OCaml☆31Updated 2 years ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- The MLtonLibrary repository☆35Updated 2 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆45Updated 5 years ago
- OCaml interpreter☆102Updated 6 years ago
- Examples from the class CMSC 330 during Summer 2015☆49Updated 10 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- ☆38Updated 6 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- An OCaml interface to the Enlightenment Foundation Libraries (EFL) and Elementary☆27Updated 3 years ago
- A practical LLVM backend for OCaml (will never be finished)☆35Updated 11 years ago
- OCaml Programming Patterns - random tricks, "design patterns", etc.☆52Updated 5 months ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- OCaml with macros☆60Updated 2 months ago
- Pure Type Systems for Functional Programming☆31Updated 5 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 12 years ago
- Scrap Your Boilerplate for MetaOCaml with modular implicits☆17Updated 10 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Updated 10 years ago
- Nanopass for OCaml☆149Updated 8 years ago
- ☆28Updated 6 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆64Updated 4 years ago
- Generic implementation of different CFA families based on monadic decomposition☆23Updated 12 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago