BNF wrangling and railroad diagrams
-
Updated
Apr 11, 2025 - 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
A basic C language compiler from scratch.
Context-free grammar parsing library
Vamos construir um compilador. Tradução e adaptação do tutorial Let's Build A Compiler de Jack Crenshaw.
Building a simple programming language based on arithmetic expressions using a top-down recursive descent parser written in Python and C.
Parser for treebanks based on Penn Treebank type of encoding that generates Probabilistic Context Free Grammars
Ash - alpha shell.
Math ExpressionParser using BNF
A small MongoDB Interpreter created with C .
First and follow calculator for CFG made in C