Peter's Amazing Syntax Tree Analyzer
-
Updated
May 24, 2024 - 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.
Peter's Amazing Syntax Tree Analyzer
Toy object-oriented programming language with LLVM backend
Project for my front-end compilers exam A.Y. 2023-2024
C++ Mathematical Expression Parsing And Evaluation Library https://www.partow.net/programming/exprtk/index.html
A language and compiler for irregular tensor programs.
C++ Insights - See your source code with the eyes of a compiler
Programming language designed for the purpose of studying compilation and runtime processes. As a side note, OCaml was also introduced to contrast with imperative languages.
Simple mathematical expression solver that supports operator priorities.
A library to parse C/C++ source as AST
Compiler for a subset of the C programming language.