/*
 * [The "BSD license"]
 *  Copyright (c) 2010 Terence Parr
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *  1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *  2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *  3. The name of the author may not be used to endorse or promote products
 *      derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 *  IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 *  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 *  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 *  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 *  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 *  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 *  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package org.antlr.analysis;

import org.antlr.misc.Barrier;
import org.antlr.tool.ErrorManager;
import org.antlr.tool.Grammar;

/** Convert all decisions i..j inclusive in a thread */
public class NFAConversionThread implements Runnable {
	Grammar grammar;
	int i, j;
	Barrier barrier;
	public NFAConversionThread(Grammar grammar,
							   Barrier barrier,
							   int i,
							   int j)
	{
		this.grammar = grammar;
		this.barrier = barrier;
		this.i = i;
		this.j = j;
	}
	public void run() {
		for (int decision=i; decision<=j; decision++) {
			NFAState decisionStartState = grammar.getDecisionNFAStartState(decision);
			if ( decisionStartState.getNumberOfTransitions()>1 ) {
				grammar.createLookaheadDFA(decision,true);
			}
		}
		// now wait for others to finish
		try {
			barrier.waitForRelease();
		}
		catch(InterruptedException e) {
			ErrorManager.internalError("what the hell? DFA interruptus", e);
		}
	}
}