A Lévy-optimal lambda calculus reducer with a backdoor to C
Fictional Language to C Trans-compiler
DFA (Deterministic Finite Automata)
Source-to-source compiler(trans-Compiler) on a custom Fictional Language(FL) using Flex & Bison as part of a project on Theory of Computation
Compiler assignment for the purposes of the Theory of Computation Lesson in TUC
O objetivo do trabalho prático é desenvolver um compilador para um subconjunto da linguagem C (chamada C-)
⚡ A C implementation of the Cocke–Younger–Kasami (CYK) algorithm to determine if a string belongs to a context-free grammar in Chomsky Normal Form (CNF). Includes input parsing, validation, detailed parse table output, and a clean Makefile-based build system. Great for compiler theory enthusiasts and students! 💻📚
First project of Theory of Computation course (IFCE) (2016.1)
A Turing Machine simulator for the language L={0^2^n}
Esse é um exemplo de analisador sintático para validar expressões aritméticas que incluem parênteses, colchetes e chaves.
A transpiler that converts programs written in the custom 'Lambda' language (designed for lab assignments) into equivalent C code. Built using Flex and Bison for lexical analysis and parsing. Developed as part of the "Computation Theory" course (2024–2025) at ECE TUC.
Trabajo práctico transversal / Teoría de la Computación 1
Add a description, image, and links to the theory-of-computation topic page so that developers can more easily learn about it.
To associate your repository with the theory-of-computation topic, visit your repo's landing page and select "manage topics."