TutorialΒΆ

Contents:

  • Deterministic finite automata
    • Loading DFAs from files
    • Creating DFAs in code
    • Editing DFAs graphically
    • Inspecting DFAs
    • Running DFAs
  • Nondeterministic finite automata
    • Creating NFAs
    • Running NFAs
  • Regular expressions
    • From regular expressions to NFAs
    • From NFAs to regular expressions
  • Context-free grammars
    • Creating CFGs
    • From CFGs to PDAs
      • Shift-reduce parsing
      • LL(1) parsing
      • LR parsing
    • From PDAs to CFGs
  • Pushdown automata
    • Creating PDAs
    • Running PDAs
  • Turing machines
    • Creating TMs
    • Running TMs
  • More general machines
    • Store types
      • BASE
      • STREAM
      • TAPE
    • Low-level interface

tock

Navigation

Contents:

  • Tutorial
    • Deterministic finite automata
    • Nondeterministic finite automata
    • Regular expressions
    • Context-free grammars
    • Pushdown automata
    • Turing machines
    • More general machines
  • Reference

Related Topics

  • Documentation overview
    • Previous: tock: Theory of Computing toolKit
    • Next: Deterministic finite automata

Quick search

©2022, David Chiang. | Powered by Sphinx 4.5.0 & Alabaster 0.7.12 | Page source