DFA (Java Lookahead Parser Generator)

Object
- DFA<T>

All Implemented Interfaces:

Iterable<DFAState<T>>
```
public class DFA<T>
extends Object
implements Iterable<DFAState<T>>
```
This class represents the deterministic finite automaton. Note that all states included in automaton are not necessarily members of this deque.

Method Summary

Methods
Modifier and Type	Method and Description
`boolean`	`acceptEmpty()` Returns true if this dfa can accept empty string.
`void`	`calculateMaxFindSkip()` Calculates how many characters we can skip after failed find operation
`void`	`dump(PrintStream p)`
`DFAState<T>`	`getRoot()`
`int`	`initialSize()` Note that this initialSize is the initial initialSize.
`boolean`	`isAcceptStart()` Returns true if at least one of the states of this dfa accepts a range prefix.
`Iterator<DFAState<T>>`	`iterator()`
`static void`	`main(String... args)`
`int`	`maxDepth()` Calculates the maximum length of accepted string.
`int`	`minDepth()` Calculates the minimum length of accepted string.
`String`	`name()`
`boolean`	`RemoveRepeatingTransitions()` Removes repeated transitions with the same token.

Methods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Method Detail
  - getRoot
```
public DFAState<T> getRoot()
```
  - name
```
public String name()
```
  - initialSize
```
public int initialSize()
```
    Note that this initialSize is the initial initialSize. If changes are made to the dfa the initialSize is not automatically updated.
    
    Returns:
  - isAcceptStart
```
public boolean isAcceptStart()
```
    Returns true if at least one of the states of this dfa accepts a range prefix. For 'abcdef' returns false. For 'abcabcde' returns true.
    
    Returns:
  - acceptEmpty
```
public boolean acceptEmpty()
```
    Returns true if this dfa can accept empty string.
    
    Returns:
  - RemoveRepeatingTransitions
```
public boolean RemoveRepeatingTransitions()
```
    Removes repeated transitions with the same token. After this method call the Transition.getRepeat method must be consulted in able to detect repetitions.
    
    See Also:
    Transition.getRepeat()
  - maxDepth
```
public int maxDepth()
```
    Calculates the maximum length of accepted string. Returns Integer.MAX_VALUE if length is infinite. For "if|while" returns 5. For "a+" returns Integer.MAX_VALUE.
    
    Returns:
  - minDepth
```
public int minDepth()
```
    Calculates the minimum length of accepted string. For "if|while" returns 2. For "a*" returns 0.
    
    Returns:
  - calculateMaxFindSkip
```
public void calculateMaxFindSkip()
```
    Calculates how many characters we can skip after failed find operation
  - iterator
```
public Iterator<DFAState<T>> iterator()
```
    Specified by:
    
    iterator in interface Iterable<DFAState<T>>
  - dump
```
public void dump(PrintStream p)
```
  - main
```
public static void main(String... args)
```

Class DFA<T>

Method Summary

Methods inherited from class Object

Method Detail

getRoot

name

initialSize

isAcceptStart

acceptEmpty

RemoveRepeatingTransitions

maxDepth

minDepth

calculateMaxFindSkip

iterator

dump

main