Parsing — A Simple Onepass Compiler
A Simple Onepass Compiler — Understanding Parsing Now that we have a tiny language called Ompass, imagine someone writes this …
A Simple Ompass Cempiler — Syntax-directed translation
🧠 What Does “Syntax-Directed” Really Mean? Let’s take a simple idea: Every piece of work the compiler does is attached …
A Simple Ompass Compiler — Syntax definition
🧠 Why Do We Need a Syntax Definition? Imagine reading a sentence like: Runs dog the fast very You can …
Decidability: Countable Sets (The Halting Problem Revisited)
1. What does “countable” really mean? Think about counting objects: If you can arrange the things in a list like …
Understanding the Language ATM — Decidability
What Exactly Is ATM? Imagine you have: The language ATM contains all the pairs ((M, w)) where the answer to …
Understanding the Language ACFG — Decidability
🌿 Decidability — Understanding the Language ACFG (When Does a Context-Free Grammar Produce Any String?) Let’s imagine you’re handed a …
Understanding the Language ANFA — Decidability
🌱 What Exactly Is ANFA? ANFA is not a language made of normal strings.Instead, every element in this language is …
The Language ADFA — Decidability
🌼 What exactly is ADFA? ADFA is a collection of machines—specifically, DFAs. But it includes only those DFAs that accept …
Decidable and Undecidable Languages
🌟 1. Decidable Languages A language is decidable if there exists a machine — usually pictured as a Turing Machine …
The Church–Turing Thesis
🌱 1. Why We Needed This Thesis Before modern computers existed, mathematicians wondered: Two great thinkers worked on this problem …