FancyPars-lite
Parser generator for compilers
A fast parser generator tailored to support transcompilers, with a custom grammar format requiring additional documentation.
FancyPars - a very fast parserGenerator
5 stars
4 watching
2 forks
Language: D
last commit: over 6 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A C++ library for defining and executing parsers as extended parsing expression grammars with support for context-sensitive grammar handling. | 67 | |
| A tool for generating parsers at compile-time using D programming language | 45 | |
| A C# library that simplifies the generation of lexers and parsers using compact, type-safe definitions. | 377 | |
| A tool for generating LALR(1) parsers from a specification language | 14 | |
| A toolset for generating verifiable parsers and protocol state machines from formal specifications. | 107 | |
| A parser generator tool that creates recursive descent parsers from concise grammar definitions. | 1,480 | |
| A tool for generating parsers from parsing expression grammars using the Packrat parser generator | 1,028 | |
| A Scala-based library for writing fast parsers using parser combinators. | 1,098 | |
| A collection of examples and demos showcasing the functionality of a parser generator for C# | 12 | |
| A tool for generating parsers from regular expressions in Haskell. | 292 | |
| A tool that generates parsers and scanners for C# programs | 58 | |
| Automates the process of building parsers in OCaml with minimal boilerplate code | 125 | |
| A Python parser generator with RPython support, designed to provide a more efficient and flexible alternative to traditional parsing approaches. | 379 | |
| An API for creating parsers in JavaScript that generates bottom-up parsers from grammar files | 119 | |
| Translates natural language into formal representations using Combinatory Categorial Grammar (CCG), enabling semantic parsing. | 59 |