CS Theory Lab
Pick your subject. Each one has its own lab page with every tool and worked guide for it, grouped by topic so you can jump to what your course covers: Compiler Design Lab, Theory of Computation Lab, Operating Systems Lab, DBMS Lab and Algorithms Lab (all linked below).
1. Compiler design
Topic modules cover lexical analysis, parsing (FIRST/FOLLOW, LL(1), LR, operator precedence), SDT and three-address code, run-time environments, and optimization. Open the Compiler Design Lab for the full list.
FIRST and FOLLOW Calculator
Find FIRST and FOLLOW sets for a grammar
LL(1) Parser
Build an LL(1) table, check conflicts and trace a parse
LR Parser (LR(0), SLR, LALR, CLR)
Build LR parsing tables and trace shifts and reductions
Three Address Code Generator
Turn expressions and simple control flow into three-address code
2. Theory of computation
Finite automata, regular expressions, pushdown automata, Turing machines and grammars. Open the Theory of Computation Lab for the full list.
Finite Automata Simulator (NFA/DFA)
Draw a finite automaton and trace strings step by step
NFA to DFA Converter
Turn an NFA into a DFA with the subset construction shown
DFA Minimizer
Merge equivalent DFA states and see each minimization step
Regex to NFA Converter
Turn a regular expression into an NFA diagram
3. Operating systems
CPU scheduling, page replacement, memory allocation, deadlock avoidance, cache mapping and disk scheduling. Open the Operating Systems Lab for the full list.
4. DBMS and algorithms
Attribute closure, candidate keys and SQL to relational algebra for databases; the master theorem, Huffman coding and hashing for algorithms. Each has its own lab.
Attribute Closure Calculator
Find attribute closure and check whether a set is a superkey
Candidate Key Finder
Find candidate keys from functional dependencies
Master Theorem Calculator
Find running-time bounds for divide-and-conquer recurrences
Huffman Coding Calculator
Build Huffman codes and a tree from symbol frequencies
Other labs
Frequently asked questions
Which page should I share with my class?
The subject lab: for example the Compiler Design Lab for a compiler course. Each subject lab lists only that subject's tools and guides, grouped by topic.
Do these tools show the steps or just the answer?
The steps. Subset construction lists every DFA state, the LR parser shows every item set and table entry, and the CPU scheduler shows the ready queue at each moment.
Is this a replacement for JFLAP?
For finite automata, PDAs and Turing machines it covers most of what a course needs, in the browser with no Java. JFLAP still does more with grammars and some machine types; see the JFLAP comparison page for the details.