Deterministic Finite Automata in C++, Token Parser & Lexer
-
Updated
Jan 28, 2013 - 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.
Deterministic Finite Automata in C++, Token Parser & Lexer
Compilers course project @ IST 2013
Simple Proof of Concept C-subset Compiler - develeped as a Compiler course project
Protocol Buffers lexer & parser for PLY
A pascal compiler for MIPS platform written in python.
A Browserify transform for Jison parsers.
A homemade lexer and parser for a small language using no tools.
PHP parser combinators
zerp is a collection of utilities for Z, a toy programming language similar in syntax to Python and Pascal
The Angler Functional Programming Language