BNF wrangling and railroad diagrams
-
Updated
Sep 25, 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.
BNF wrangling and railroad diagrams
The CMU Link Grammar natural language parser
Clojure(Script) grammar for tree-sitter
SystemVerilog grammar for tree-sitter
A tree-sitter grammar for TLA⁺ and PlusCal
Automated machine learning (AutoML) with grammar-based genetic programming
reStructuredText grammar for tree-sitter
Tree Sitter Grammar for Angular
A tree-sitter grammar for the Django template language
Very tiny compiler for a simple arithmetic language.
tree-sitter grammar for libra move language
Tree-sitter grammar for Hy, a Lisp-ification of Python.
Compiler Design using lex and c programming language.
Front-end Platypus compiler implemented in C. Includes Buffer, Scanner, and Parser. Platypus is a language comprised of parts from a variety of other languages.