move out of way but keep

[git-p4: depot-paths = "//depot/code/antlr4/main/": change = 6777]
This commit is contained in:
parrt 2010-03-27 10:54:05 -08:00
parent 2f5eb69cdd
commit 09974258fb
2 changed files with 6 additions and 6 deletions

View File

@ -75,7 +75,7 @@ import java.util.List;
*
* This case also catches infinite left recursion.
*/
public class RecursionLimitedNFAToDFAConverter extends StackLimitedNFAToDFAConverter {
public class unused_RecursionLimitedNFAToDFAConverter extends unused_StackLimitedNFAToDFAConverter {
/** This is similar to Bermudez's m constant in his LAR(m) where
* you bound the stack so your states don't explode. The main difference
* is that I bound only recursion on the stack, not the simple stack size.
@ -145,7 +145,7 @@ public class RecursionLimitedNFAToDFAConverter extends StackLimitedNFAToDFAConve
*/
public IntSet recursiveAltSet = new BitSet();
public RecursionLimitedNFAToDFAConverter(Grammar g, DecisionState nfaStartState) {
public unused_RecursionLimitedNFAToDFAConverter(Grammar g, DecisionState nfaStartState) {
super(g, nfaStartState);
}

View File

@ -13,7 +13,7 @@ import java.util.*;
* per DFA (also required for thread safety if multiple conversions
* launched).
*/
public class StackLimitedNFAToDFAConverter {
public class unused_StackLimitedNFAToDFAConverter {
Grammar g;
DecisionState nfaStartState;
@ -85,12 +85,12 @@ public class StackLimitedNFAToDFAConverter {
public static boolean debug = false;
public StackLimitedNFAToDFAConverter(Grammar g, DecisionState nfaStartState) {
public unused_StackLimitedNFAToDFAConverter(Grammar g, DecisionState nfaStartState) {
this.g = g;
this.nfaStartState = nfaStartState;
dfa = new DFA(g, nfaStartState);
dfa.converter = this;
resolver = new Resolver(this);
// dfa.converter = this;
//resolver = new Resolver(this);
}
public DFA createDFA() {