Forlan Manual

Table of Contents

• Introduction
• Top-level Environment
  • Version
  • Parameters
  • Debugging
  • Using Files
  • Basic Types
  • Conversions Between Basic Types and Strings
  • Regular Expressions
  • Labeled Paths
  • Finite Automata
  • Injections and Projections Between Finite Automata
  • Conversions Between Finite Automata
  • Conversions Between Finite Automata and Regular Expressions
  • Regular Expression Finite Automata
  • Parse Trees
  • Grammars
  • Programs
• Modules
  • Version
    • The Version Module
  • Parameters
    • The Params Module
  • Debugging
    • The Debug Module
  • Auxiliary Functions
    • The ListAux Module
  • Pretty Printing and Messages
    • The PP Module
    • The Messages Module
  • Using Files
    • The Use Module
  • Sorting, Sets, Relations and Tables
    • The Sort Module
    • The Set Module
    • The Rel Module
    • The Tab Module
  • Lexical Analysis
    • The Lex Module
  • Symbols and Strings
    • The Sym Module
    • The Str Module
    • The SymSet Module
    • The StrSet Module
    • The SymRel Module
  • Finite Automata and Regular Expressions
    • The Reg Module
    • The LP Module
    • The Tran Module
    • The TranSet Module
    • The FA Module
    • The EFA Module
    • The NFA Module
    • The DFA Module
    • The TranReg Module
    • The TranRegSet Module
    • The RFA Module
  • Grammars
    • The PT Module
    • The Prod Module
    • The ProdSet Module
    • The Gram Module
  • Programs
    • The Var Module
    • The VarSet Module
    • The Prog Module

Forlan Version 3.5
Copyright © 2000-2009 Alley Stoughton