lemon.external.gadfly.kjParser.FSMachine

Package lemon :: Package external :: Package gadfly :: Module kjParser :: Class FSMachine

[show private | hide private]

Class FSMachine

Known Subclasses:: CFSMachine

Method Summary
	`__init__(self, rootNonTerm)`
	`DUMP(self, DumpMapData, DumpStateData, ForbiddenMark)` ForbiddenMark is for filtering out maps to an error state...
	`Expects(self, State)` what tokens does a state expect?...
	`map(self, current_state, current_token)` Find the action indicated by fsm on (current_state, current_token) input.
	`NewState(self, kind, AdditionalInfo)` "allocate" a new state of specified kind...
	`SetMap(self, fromState, TokenRep, toState)` Install a "shift" or "goto transition in the FSM:...
	`SetReduction(self, fromState, TokenRep, Rulenum)` Install a reduction transition in the FSM: a reduction is represented by mapping to a rule index no nondeterminism is allowed.

Method Details

DUMP(self, DumpMapData=1, DumpStateData=1, ForbiddenMark={})

ForbiddenMark is for filtering out maps to an error state

Expects(self, State)

what tokens does a state expect?

map(self, current_state, current_token)

Find the action indicated by fsm on
 (current_state, current_token) input.

note: in the event of nondeterministic choice this chooses
  the first possibility listed.
ParseObj.DoOneReduction() currently uses the internal structure
 of StateTokenMap directly, rather than using this function.

NewState(self, kind, AdditionalInfo=[])

"allocate" a new state of specified kind
  kind must either be TRANSFLAG, TERMFLAG or a rule object
returns the number of the new state

SetMap(self, fromState, TokenRep, toState)

Install a "shift" or "goto transition in the FSM:
supports nondeterminism by storing a sequence of possible
transitions

SetReduction(self, fromState, TokenRep, Rulenum)

Install a reduction transition in the FSM:
a reduction is represented by mapping to a rule index
no nondeterminism is allowed.

Generated by Epydoc 2.0 on Mon Nov 10 15:07:53 2003

http://epydoc.sf.net