Alternatives and similar repositories for patrisika

Users that are interested in patrisika are comparing it to the libraries listed below

• Dwarfartisan / ruskell
  Some Haskell Functions Written As Rust Library.
  ☆36Updated 9 years ago
• Ninputer / qcon_demo
  Parser combinator demos for QCon 2015
  ☆21Updated 10 years ago
• tdop / tdop.github.io
  Reprinting Vaughan Pratt's Paper on Top Down Operator Precedence Parsing
  ☆122Updated last year
• refi64 / rejit
  A work-in-progress JIT-powered regex engine
  ☆112Updated 7 years ago
• TomBebbington / js.rs
  An experimental Javascript parser and just-in-time compiler written in Rust
  ☆139Updated 11 years ago
• cheery / chartparser
  Chart parser (Earley SPPF)
  ☆27Updated 6 years ago
• Cirru / parser.coffee
  Parser of indentation grammar
  ☆42Updated last month
• bobzhang / fan
  Compile-time metaprogramming for OCaml
  ☆74Updated last year
• ottypes / libot
  A minimal C library for operational transform
  ☆112Updated 10 years ago
• haberman / gazelle
  A system for creating fast, reusable parsers
  ☆172Updated 10 years ago
• noahvanes / slip.js
  A Scheme interpreter in asm.js
  ☆15Updated 8 years ago
• coreperf / rejit
  fast SIMD-able JIT regular expression compiler
  ☆197Updated 10 years ago
• Cirru / cirru-script-editor
  [Deprecated] using respo-cirru-editor instead
  ☆30Updated 9 years ago
• xye7ei / metaparse
  A handy tool to help design and parse your own language
  ☆21Updated 3 years ago
• dirk / hummingbird
  Experimental language
  ☆56Updated 2 years ago
• pcwalton / zero.rs
  A module for freestanding Rust programs
  ☆246Updated 12 years ago
• jorendorff / gc-in-50-lines
  An example mark-and-sweep garbage collector in 50 lines of C++
  ☆54Updated 8 years ago
• cyphar / redone
  A *correct* implementation of regular expression matching (using finite state automata).
  ☆49Updated 9 years ago
• be5invis / PatEL
  The Patrisika Example Language
  ☆50Updated 11 months ago
• hmgle / yascm
  Yet Another Scheme Interpreter using flex and bison
  ☆49Updated 3 years ago
• djc / runa
  A Python-like systems programming language
  ☆84Updated 9 years ago
• orlandohill / peg-left-recursion
  An idea to handle left-recursion in Parsing Expression Grammars (PEGs)
  ☆36Updated 15 years ago
• rainoftime / PFAD
  Pearls of Functional Algorithm Design
  ☆67Updated 10 years ago
• brownplt / LambdaS5
  Semantics for ES5
  ☆82Updated 10 years ago
• melvinzhang / bit-scheme
  BIT: A Very Compact Scheme System for Microcontrollers
  ☆43Updated 9 years ago
• tianyicui / golio
  Go! Lisp in OCaml
  ☆75Updated 13 years ago
• js-js / jit.js
  JIT Assembler in javascript
  ☆288Updated 10 years ago
• waxeye-org / waxeye
  Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, JavaScript, Python, Racket, and Ruby.
  ☆235Updated 2 years ago
• logicchains / LPATHBench
  Benchmarks of the longest path problem in various languages
  ☆155Updated 6 years ago
• ckkashyap / rustix
  Unix kernel in rust
  ☆98Updated 10 years ago