Generate deterministic semantic fingerprints for Go functions. Detect xz-style backdoors and verify semantic equivalence using Static Single Assignment (SSA) analysis and Scalar Evolution.

First two front-end phases of a language-independent compiler implemented in C++

An interactive C++ tool for learning LL(1) and SLR(1) parsers. SyntaxTutor generates random grammars and guides students through FIRST, FOLLOW, closure, and parsing table calculations with step-by-step feedback.

Morphological Source Code (+QSD, /MOONLAPSED/cognosis branch) implemented in Python3 for contemporary hardware. Operates as a quantized kernel of agentic motility, akin to a Hilbert space kernel; augmented by an AdS/CFT Noetherian jet space enabling category-theoretic syntax-lift/lower, morphological differentiation, and morphosemantic integration.

A simplistic programming language interpreter to Python to help students grasp finite automata theory programmatically and with a computed graph through visualization libraries.

University report and code of the unit Compiler Theory and Practice

Customer parser and compiler for JVM built from scratch using ASM and Java

Java version of the Compiler Theory and Design class in UMGC. It was in C language now I turned it into Java for fun.

Deliverables relating to the Compiler Theory and Practice University Unit

Implementation of a COOL interpreter that has type inference by adding the type AUTO_TYPE

A Java tool for converting non-deterministic finite automata (AFN) to deterministic ones (AFD), with a Swing-based GUI.

Arithmetic expression translator with lexer, LL(1) parser, and 3-address intermediate code generation in Python

My implementation of a compiler and Written Exam done for DVA339 - Compiler Theory at Malardalen University

The presentation of the first MuseMI meeting of the 2025/2026 season, held in Milan on December 4, 2025.