A compiler that accepts any valid program written in C. It is made using Lex and Yacc. Returns a symbol table, parse tree, annotated syntax tree and intermediate code.
-
Updated
Apr 24, 2023 - Yacc
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.
A compiler that accepts any valid program written in C. It is made using Lex and Yacc. Returns a symbol table, parse tree, annotated syntax tree and intermediate code.
A compiler Design Project Repository Contains Lexical,Parser,Semantic analyzer and ICG modules.
CSE-310 Compiler Sessional
A short subset of C Compiler
Naive implementation of type checking for the rust language
Transpiler from CT language to Java
CSE 310 - Compiler Sessional
This project is a compiler for a special form of math expressions using Lex and Yacc.
A simple terminal calculator
A simple parser for a simple grammar using lex and yacc tools.
Tiny-C Compiler: A complete implementation of a compiler for the TinyC language, a subset of the C programming language spec, developed using Lex and Bison.
🔧 My studies involving context-free grammar analysis. The analyzers were built using familiar tools such as YACC, Lex and Bison. Topics covered include token filtering, simple variable manipulation, and arrays.
Specifications You will extend calc.l and calc.y to parse and type check programs whose syntax is defined below. Prog ! main() {Stmts} Stmts ! ε | Stmt; Stmts Stmt ! int Id | float Id | Id = E | printvar Id E ! Integer | Float | Id | E + E | E * E Integer ! digit+ Float -> Integer . Integer