Design grammar and implement a top-down/ bottom-top translator that represent a boolean calculator using python.

university laboratory works

A JavaCC project to implement a Lexical Analyser and a Top-Down Parser for a simple language.

Compiler developed in the Computer Engineering course as a didatic model, using recursive-descent parsing and backpatch based code generation to the target assembly language,

🖨️ Formal Languages and Compiler Design Uni Laboratory tasks

Recursive descent parser implementation on a simple grammar using python.

Teamwork project for the Compilers course

Implementation of parsers in compiler design

Counting the number of atoms in a molecular formula

Compiler Design - Fall 2023 - Sharif University of Technology

Very small top down parser as a university project

The user can write or choose a text and analyze it lexically according to a Regex and analyze it syntactically according to a grammar of the language and can see the first-follow sets of the grammar and the predictive table and the parse tree of the input

CIT-412 (Compiler Design and Autometa Theory Sessional)

Top-Down parser and Bottom-Up parser. These are the parsers that I have made for the final project of "Formal Languages and Compilers" at EAFIT University

BNF (Backus-Naur Form) LL(k) parser.

A top down parser which uses tokens of this excercise

Top-Down Parser for given language

LL1 top down parser

Pascal Compiler uses top-down parsing to compile the Pascal code, and works with the lexer that breaks down the code into tokens. There are 6 token types that lexer recognizes: word, integer, real, real with an e., special characters and column-equal.