Computer science
Trace an algorithm, test a grammar or work through a subject one step at a time.
Start here
Finite Automata Simulator (NFA/DFA)
Draw a finite automaton and trace strings step by step
DFA Minimizer
Merge equivalent DFA states and see each minimization step
FIRST and FOLLOW Calculator
Find FIRST and FOLLOW sets for a grammar
CPU Scheduling Calculator
Compare CPU schedules with Gantt charts and waiting times
Candidate Key Finder
Find candidate keys from functional dependencies
Karnaugh Map Solver
Simplify Boolean functions on a two- to four-variable map
All computer science tools
Automata and formal languages
Compilers and parsing
- FIRST and FOLLOW Calculator
- LL(1) Parser
- LR Parser (LR(0), SLR, LALR, CLR)
- CYK Parser
- Operator Precedence Parser
- Recursive Descent Parser Generator
- Parse Tree Generator and Ambiguity Checker
- SDT Annotated Parse Tree
- Left Recursion and Left Factoring Calculator
- Lexical Analyzer
- Phases of a Compiler
- Infix to Postfix and Prefix
- Three Address Code Generator
- Basic Blocks and Flow Graph
- Code Optimizer
- Data-Flow Analysis
- Activation Records and Parameter Passing
- Simple Code Generator
Algorithms and data structures
Logic and computer architecture
Operating systems
Databases
Networks and signals
Learn by doing
Useful guides
- NFA to DFA: The Subset Construction
- Logic Gates: Truth Tables and Examples
- Attribute Closure and Candidate Keys: Example
- DFA Minimization: Hopcroft's Algorithm
- FIRST and FOLLOW Sets Example, Step by Step
- Round Robin Scheduling Example with Gantt Chart
- Why K-Maps Use Gray Code Order
- Dijkstra's Algorithm Example: Step by Step
- AVL Tree Rotations Explained: LL, RR, LR, RL
- IEEE 754 Single Precision Conversion Example
Common questions
Are the labs tied to a particular university syllabus?
No. Labs are grouped by topic, so you can choose the part your course covers and follow its tools and worked guides in order.
Where are the compiler and automata tools?
Open the compiler design lab for lexical analysis, parsing, intermediate code and optimization. The theory of computation lab covers finite automata, pushdown automata, Turing machines and grammars.
Can I use these tools to check homework?
Use the steps and traces to compare your reasoning with the result. Check the assumptions and supported inputs on each tool page, and follow your course conventions when they differ.