Construct Parsers of any complexity using a declarative fluent syntax in C#.
-
Updated
Dec 22, 2023 - C#
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
Construct Parsers of any complexity using a declarative fluent syntax in C#.
ANTLR 4 parser generator command line tool
"Parser gramMar anaLyzer" - Context-Free Grammar analyzer and generator.
Re-implementation of the GoldParser builder
X39s Code Generator - Creating your CST (Concrete-Syntax-Tree) with ease
Recursive descent LL(k) parser for .NET with Fluent API, BNF, EBNF and Gold Grammars
LALR Parse Table Generator. Currently just reads from a .g file and spits out a table + F#. It reports conflicts and solves them according to precedence and associativity rules.
.NET runtime LALR parser generator
Turbo Coco/R is a compile-time compiler generator which takes an attributed grammar of a source language and generates a scanner and a parser for this language.
C# Parser Generator is a tool that allows you to create LALR parsers. It includes a lexical, syntactic and semantic parser that can work at run time with native C# code, with no dependencies.
🍁 Compiler Compiler based on CSharp with GUI Program
Desktop Antlr Grammar Editor
A multiparadigm language intended to be embedded in .NET applications or compiled into other languages like Python or PHP. The internals of Aphid are clean and easy to work with, allowing for rapid creation of derivative domain-specific languages.