A concrete syntax tree is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar.
Parse BNF grammar definitions
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 simple parse tree generator for any user-defined LR(1) programming language
A collection of tools to process DFM files
2nd Year: 1st - 97. A full parser for first order logic, producing a parse tree (png) and a grammar containing all production rules and symbols, along with a log file.
Desktop app for visualizing parse tree , abstract syntax tree , action table , parse table for any valid LL1 grammar.
This project parses and evaluates arithmetic expressions using recursive descent parsing based on BNF grammar rules.
College project where I implemented a recursive descent parser and parse tree evaluator in C.
A compiler made with c# used to compile tiny language containing scanning and parsing phases that produce token list and parse tree.
Projeto desenvolvido em grupo durante a disciplina de Linguagens e Paradigmas de Programação (6º semestre do curso de Ciência da Computação)
Utilities for lark's ambiguous trees
This project is on inspecting change types from commits (QRS2021)
An implementation of a recursive-descent parser/interpreter that evaluates arithmetic expressions based on a simple BNF grammar
💻 Implementation of a lexical analyser and an SLR parser in Java for my IA to IB compilers summer work task. (more details in README).
Explore compiler design basics with Phases of Compiler, a project demonstrating lexical and syntax analysis in C++.
LaTeX-CV-Gen is a Python project that allows you to generate LaTeX CVs from YAML profile data. It provides a simple command-line interface to parse YAML data, process LaTeX templates, and generate PDF CVs.