Rust parser combinator framework
-
Updated
Feb 14, 2021 - Rust
#
parser-combinators
Here are 337 public repositories matching this topic...
Parsing Expression Grammar Template Library
parsing
parser-combinators
cpp
grammar
cpp11
parsing-expression-grammar
header-only
cpp17
peg
parsing-expression-grammars
pegtl
-
Updated
Feb 12, 2021 - C++
Python library for creating PEG parsers
python
parsing
parser-combinators
python3
parsing-expression-grammar
python-3
text-processing
python-2
python2
parsing-library
peg-parsers
-
Updated
Jan 5, 2021 - Python
A parser combinator library for Rust
-
Updated
Jan 7, 2021 - Rust
A tool for structural code search and replace that supports ~every language.
javascript
refactoring
python
c
java
go
swift
rust
syntax
php
typescript
parsing
parser-combinators
linting
regex
reason
rewriting
search-and-replace
program-transformation
syntax-transformation
-
Updated
Feb 7, 2021 - OCaml
Yay is a high level PHP preprocessor
-
Updated
Oct 4, 2019 - PHP
C#'s fastest parser combinator library
-
Updated
Jan 19, 2021 - C#
Parser combinators built for speed and memory efficiency
-
Updated
Jan 12, 2021 - OCaml
-
Updated
Feb 13, 2021 - JavaScript
PEG parser combinators using operator overloading without macros.
-
Updated
Feb 7, 2021 - Rust
Recursive descent parsing library for Python based on functional combinators
-
Updated
Jan 9, 2021 - Python
Parsica - PHP Parser Combinators - The easiest way to build robust parsers.
-
Updated
Feb 13, 2021 - PHP
Create models from a JSON file, even a Baby can do it.
-
Updated
Jan 8, 2019 - Swift
Type safe url pattern matching without regular expressions and arguments type mismatches based on parser combinators.
-
Updated
Feb 20, 2020 - Swift
Parser combinator in Go. If there are any cross platform issues or backward compatibility issues, please reach out.
-
Updated
Feb 10, 2021 - Go
A parser combinator library written in the Swift programming language.
-
Updated
May 5, 2020 - Swift
A parser combinator library for Elixir projects
-
Updated
Jun 4, 2020 - Elixir
A Scala implementation of parsing with derivatives
-
Updated
Jan 1, 2020 - Scala
A concise and readable language for Firestore security rules, similar to Firebase Bolt.
-
Updated
Oct 15, 2020 - Haskell
A universal Python parser combinator library inspired by Parsec library of Haskell.
-
Updated
Jan 30, 2021 - Python
JavaScript parser-combinator library
-
Updated
Nov 25, 2020 - TypeScript
A clean, efficient parser combinator
-
Updated
Feb 25, 2020 - Rust
JavaScript practical parser generator library using combinators
-
Updated
Sep 5, 2020 - JavaScript
Self-contained monadic parser combinators for OCaml
-
Updated
Apr 4, 2020 - OCaml
Cthaeeh
commented
Apr 20, 2019
Hi,
I don't know if its possible but maybe this can be somehow handled better:
If I have a grammar rule like so:
cppcmb_def(expr) = pc::pass
| (expr & match<Token::PLUS> & primary) [BinaryExpr::make]
| (expr & match<Token::MINUS> & primary) [BinaryExpr::make]
| primary
%= pc::as_memo_d;And the met
A parser combinator library for Emacs Lisp, similar to Haskell's Parsec library.
-
Updated
Jul 30, 2018 - Emacs Lisp
String parser combinators for TypeScript
-
Updated
Oct 12, 2020 - TypeScript
Improve this page
Add a description, image, and links to the parser-combinators topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the parser-combinators topic, visit your repo's landing page and select "manage topics."
It would be nice to add the bits of code from chapter 33 of "Programming in Scala" as tests to be sure we don't break compatibility (too much) with the book.