JFLAP Tutorial

* HOME

* Finite Automata

  • Construct and Run
  • Manipulating Transitions
  • Add Trap State to DFA
  • Convert to DFA
  • Minimize DFA
  • Convert FA to Grammar
  • Convert FA to RE
  • Combine Automata
  • Layout Commands
  • Mealy Machine

    Moore Machine

    * Pushdown Automata

  • Construct and Run
  • Convert to CFG
  • * Turing Machine

  • Construct and Run
  • Multiple Tape
  • Building Blocks
  • Convert to UG
  • * Grammar

  • Enter Grammar
  • Test for Grammar Type
  • Brute Force Parser - Regular or CFG
  • Multi Run Brute Force Parser
  • Brute Force Parser - Unrestricted Grammar
  • User Control Parser
  • CYK Parser
  • Build LL(1) Parse Table
  • Build SLR(1) Parse Table
  • Convert Right-Linear Grammar to FA
  • Convert CFG to PDA(LL)
  • Convert CFG to PDA(LR)
  • Transform Grammar
  • L-System

    * Regular Expressions

    Regular Pumping Lemma

    Context-Free Pumping Lemma

    Batch Mode

    Preferences