1 /* 2 * [The "BSD license"] 3 * Copyright (c) 2010 Terence Parr 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 3. The name of the author may not be used to endorse or promote products 15 * derived from this software without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 package org.antlr.analysis; 29 30 import org.antlr.misc.Barrier; 31 import org.antlr.tool.ErrorManager; 32 import org.antlr.tool.Grammar; 33 34 /** Convert all decisions i..j inclusive in a thread */ 35 public class NFAConversionThread implements Runnable { 36 Grammar grammar; 37 int i, j; 38 Barrier barrier; 39 public NFAConversionThread(Grammar grammar, 40 Barrier barrier, 41 int i, 42 int j) 43 { 44 this.grammar = grammar; 45 this.barrier = barrier; 46 this.i = i; 47 this.j = j; 48 } 49 public void run() { 50 for (int decision=i; decision<=j; decision++) { 51 NFAState decisionStartState = grammar.getDecisionNFAStartState(decision); 52 if ( decisionStartState.getNumberOfTransitions()>1 ) { 53 grammar.createLookaheadDFA(decision,true); 54 } 55 } 56 // now wait for others to finish 57 try { 58 barrier.waitForRelease(); 59 } 60 catch(InterruptedException e) { 61 ErrorManager.internalError("what the hell? DFA interruptus", e); 62 } 63 } 64 } 65 66
