m-zakeri/IUSTCompiler
IUST Compiler Design: Principles, Techniques, and Tools
This project provides practical code examples and learning materials for understanding how programming language compilers work. It takes grammar definitions for languages like Pascal or C++ as input and shows how a compiler can generate intermediate representations like 'Three Address Code' or 'Abstract Syntax Trees'. This is designed for students and educators in computer science learning about compiler design.
No commits in the last 6 months.
Use this if you are studying compiler design and need concrete examples of how to define language grammars, perform type checking, and generate intermediate code like ASTs or three-address code.
Not ideal if you are looking for a ready-to-use compiler for a specific programming language or a tool for general-purpose language parsing outside of an academic context.
Stars
8
Forks
25
Language
Python
License
MIT
Category
Last pushed
Jan 25, 2024
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ai-coding/m-zakeri/IUSTCompiler"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
javaparser/javaparser
Java 1-25 Parser and Abstract Syntax Tree for Java with advanced analysis functionalities.
asmjit/asmjit
Low-latency machine code generation
lioncash/biscuit
A runtime code generator for RISC-V
llvm-hs/llvm-hs-pretty
Pretty printer for LLVM AST to Textual IR
bytexenon/Tiny-Lua-Compiler
⛄Possibly the smallest Lua compiler ever