FANDOM


What is JFLAP?Edit

JFLAP is a package of graphical tools which can be used as an aid in learning the basic concepts of Formal Languages and Automata Theory.

Regular languages - create
  • DFA
  • NFA
  • Regular Expression
  • Regular Grammar
Indexdfa
Regular languages - conversions
  • NFA -> DFA -> Minimal DFA
  • NFA <-> regular expression
  • NFA <-> regular grammar
Indextodfa
Context-free languages - create
  • push-down automaton
  • context-free grammar
Indexpda
Context-free languages - transform
  • PDA -> CFG
  • CFG -> PDA (LL parser)
  • CFG -> PDA (SLR parser)
  • CFG -> CNF
  • CFG -> LL parse table and parser
  • CFG -> SLR parse table and parser
  • CFG -> Brute force parser
Indexslr
Recursively Enumerable languages
  • Turing machine (1-tape)
  • Turing machine (multi-tape)
  • Turing machine (building blocks)
  • unrestricted grammar
  • unrestricted gramamr -> brute force parser
Indextm
L-Systems
  • Create L-systems
Indexlsys

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.