A small library for providing baseline Context-Free Grammar computations
If you use the CodeDOM, here's an indispensable package to make it awesome.
A crash course in GLR parsing which can be used to parse highly ambiguous grammars
Glory can parse virtually anything, even natural language. Add powerful parsers to your projects. Parse languages like C# or incorporate human language parsing with your AI code.
Learn how to implement recursive descent parsers, with examples for JSON and an integer expression evaluator
Creating a simple parser in 3 easy lessons
Manage location tracking, lifetime, error reporting and basic parsing/lexing with this simple class
A completely programmable lexer/tokenizer/scanner generator in C# using a Pike Virtual Machine
An LL(1) pull parser and generator that thinks it's an LL(k) parser - with a rich, simple and beautiful EBNF syntax
Using Parsley to parse a C# subset into the CodeDOM
Use the Parsley compositional parser generator to parse a complicated grammar with backtracking.
Generate powerful, maintainable parsers in most major .NET languages using a friendly grammar format
Using PCK to create grammars, parsers and tokenizers for C# and other .NET languages
A parser generator and unification system for different parsing tools
Using PCK's grammar system, and understanding the concepts behind it
Quickly and easily build parsers and tokenizers using Pck's editor
An LALR(1) parsing algorithm as part of Pck
An initial look at a tool to dramatically simplify language agnostic code generation using the CodeDOM
Streaming your data and parsing on the go with tiny gadgets
Build a full featured tokenizer generator in C#
Stream JSON efficiently on little devices with minimal flash and memory usage
Add fast scanners/tokenizers to your C# project
Getting an accurate CodeDOM back from a C# source subset