grammarware / bx-parsing
Bidirectional Megamodel of Parsing, Tokenising, Stripping, Concatenating, Imploding, Exploding, Unparsing, Printing, Pretty-printing, Formatting, Visualising, Rendering and Recognising
☆17Updated 5 years ago
Alternatives and similar repositories for bx-parsing:
Users that are interested in bx-parsing are comparing it to the libraries listed below
- Prolog implementation of microKanren☆43Updated 10 years ago
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆21Updated 10 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆50Updated 8 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 12 years ago
- Indentation-based Racket Syntax☆37Updated 3 years ago
- ProjecturEd is a generic purpose projectional editor.☆142Updated 2 years ago
- adds an optional type system to J language☆21Updated 9 years ago
- An object-oriented dialect of Scheme☆59Updated 2 years ago
- Guile with tracing JIT VM.☆15Updated 8 years ago
- Lojban ologs (categorical databases) using jq☆23Updated 6 years ago
- A microKanren framework for implementing constraints.☆18Updated 6 years ago
- software archaeology of reflective towers of interpreters☆15Updated 5 months ago
- Racket-based implementation of Adapton☆22Updated 5 years ago
- Haskell Semantics with Lisp Syntax☆68Updated 11 years ago
- Kanren with databases☆43Updated 7 months ago
- Racket parser combinators inspired by parsack and megaparsec☆80Updated 5 months ago
- A WAM (Warren Abstract Machine for Prolog) written in Common Lisp☆13Updated 6 years ago
- A programming argot☆58Updated 11 months ago
- Kali is Kelsey and Rees's distributed Scheme implementation based on Scheme48☆37Updated 12 years ago
- The Pascal-F Verifier☆48Updated 7 years ago
- A compiler to IA32 and REPL for maru in maru under 7k s-expressions☆16Updated 4 years ago
- An embedded dialect of the OMeta language for rapidly developing compilers and code analysis tools.☆14Updated 9 years ago
- a minimal implementation of incremental computation in Scheme☆34Updated 7 years ago
- Collapsing Towers of Interpreters (in Scheme)☆56Updated 6 years ago
- Julia Implementation of Unums☆42Updated 8 years ago
- An Efficient LALR(1) Parser Generator for Scheme☆50Updated 4 years ago
- The PGG Partial Evaluation System for Scheme 48☆18Updated 12 years ago
- Higher Order Prolog with Extensional Semantics☆53Updated 4 years ago
- Probabilistic miniKanren☆61Updated 9 years ago
- YACC is dead for Common Lisp (based on http://arxiv.org/abs/1010.5023)☆40Updated 11 months ago