Rust parser combinator framework
-
Updated
Jul 22, 2021 - Rust
#
parser-combinators
Here are 361 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
Jul 21, 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
Jun 28, 2021 - Python
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
Jul 14, 2021 - OCaml
A parser combinator library for Rust
-
Updated
Jul 16, 2021 - Rust
Yay is a high level PHP preprocessor
-
Updated
Jul 21, 2021 - PHP
C#'s fastest parser combinator library
-
Updated
May 10, 2021 - C#
Parser combinators built for speed and memory efficiency
-
Updated
Jun 1, 2021 - OCaml
-
Updated
Jul 11, 2021 - TypeScript
PEG parser combinators using operator overloading without macros.
-
Updated
Feb 7, 2021 - Rust
Parsica - PHP Parser Combinators - The easiest way to build robust parsers.
-
Updated
Jun 25, 2021 - PHP
Recursive descent parsing library for Python based on functional combinators
-
Updated
Apr 17, 2021 - Python
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
Jul 15, 2021 - Swift
A concise and readable language for Firestore security rules, similar to Firebase Bolt.
-
Updated
Jun 10, 2021 - Haskell
A Scala implementation of parsing with derivatives
-
Updated
Jan 1, 2020 - Scala
A parser combinator library for Elixir projects
-
Updated
Jun 4, 2020 - Elixir
JavaScript parser-combinator library
-
Updated
Jun 28, 2021 - TypeScript
A universal Python parser combinator library inspired by Parsec library of Haskell.
-
Updated
Jun 20, 2021 - Python
A clean, efficient parser combinator
-
Updated
Feb 25, 2020 - Rust
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
JavaScript practical parser generator library using combinators
-
Updated
Sep 5, 2020 - JavaScript
Self-contained monadic parser combinators for OCaml
-
Updated
Apr 4, 2020 - OCaml
String parser combinators for TypeScript
-
Updated
Jul 7, 2021 - 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.