function resolve(){
		LRState::clear_index();
		LRStation::clear_index();
		// create Root Set
		// we SHOULD have a single etransition to an intial state
		return LRStateSet::init( $this->etransitions[0], $this->Grammar );
	}
function resolve(){
		LRState::clear_index();
		LRStation::clear_index();
		// create Root Set
		// we SHOULD have a single etransition to an intial state
		return LRStateSet::init( $this->etransitions[0], $this->Grammar );
	}
function resolve ( ) { LRState :: clear_index ( ) ; LRStation :: clear_index ( ) ; // create Root Set // we SHOULD have a single etransition to an intial state return LRStateSet :: init ( $ this -> etransitions [ 0 ] , $ this -> Grammar ) ; }
Resolve non-deterministic automaton into a deterministic state tree
@return LRStateSet
Resolve non - deterministic automaton into a deterministic state tree