A graphing library for Control Flow Graphs

Dynamic Control Flow Recovery

Modified DexDump to build instruction graph from classes.dex

Implementation trade-offs in using Intel Pin for instruction tracing of complex programs

Context-free-grammar EBNF rules generator

Header-only library for reading/saving configuration files with schema defined in sources

This is a Context Free Grammer parser written with C++.

C++ code to implement CYK algorithm with given Context Free Grammar in Chomsky Normal Form and input string. This code also prints all possible parse trees for the input string even if the grammar is ambigous.

Program in C++ that reads a context-free grammar and removes the useless symbols and productions. After that, it generates a new simplified CFG in an output file.

A parallel program to parse a string of symbols. The inputs are a context-free grammar G in Chomsky Normal Form and a string of symbols. In the end, the program should print yes if the string of symbols can be derived by the rules of the grammar and no otherwise.

The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.

Recreation of the power mode from FNaCEC:R (Five Night's at Freddy's fangame). This customizable overlay allows you to play any game with power mode

LibCfg++ is a convenient C++ library for working with configuration files.

First project for the course "Robotics" of Politecnico di Milano, a.y. 2018/2019

Designing a compiler for a defined language

Compiler Design Lab (CS4P001)

Bridge between SPAN and Clang

A school project for my Computer Graphics class at Wheaton College (MA), done in C++ with OpenGL.

based on the idea of a grammar less language by using fixed states -regular grammar-

Almost Plaintext Configuration Format C++ library: designed to be quick to compile and run, and easy to use.