antlr-haskell-0.1.0.1: A Haskell implementation of the ANTLR top-down parser generator

Copyright	(c) Karl Cronburg 2018
License	BSD3
Maintainer	karl@cs.tufts.edu
Stability	experimental
Portability	POSIX
Safe Haskell	None
Language	Haskell2010

Text.ANTLR.Lex.DFA

Description

Synopsis

type Edge s = s
type State i = i
type DFA s i = Automata (Edge s) s (State i)

Documentation

type Edge s = s Source #

DFA edges are just the symbols of our alphabet.

type State i = i Source #

DFA states are just some Eq-able value, likely integers i

type DFA s i = Automata (Edge s) s (State i) Source #

A DFA is an automata with edges labeled by symbols s and nodes representing states labeled by some type i.