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.
CSE 310 - Compiler Sessional
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.
Contains the project for the CS315- Programming Languages course
Freedom Lang, my own programming language implemented in the C language infrastructure.
This repository includes a study that aims to create and operate a new basic programming language. Detailed info in ReadMe
Construção do trabalho prático da disciplina de Compiladores (1/2024)
"Formal Languages, Automata and Compilers" course project
Transpiler from CT language to Java
This project is a compiler for a special form of math expressions using Lex and Yacc.
Naive implementation of type checking for the rust language
A short subset of C Compiler
a simple compiler use flex and bison just for university project
Compiler for the Alpha language, part of CS340 course of CSD - UoC
A Lex and Yacc-based compiler for a new language inspired by C. With its powerful parsing and lexical analysis capabilities, this compiler efficiently translates high-level code into executable machine language.