/external/libnfc-nci/ |
Android.mk | 11 NFA := src/nfa 33 $(LOCAL_PATH)/$(NFA)/include \ 34 $(LOCAL_PATH)/$(NFA)/int \ 40 $(call all-c-files-under, $(NFA)/ce $(NFA)/dm $(NFA)/ee) \ 41 $(call all-c-files-under, $(NFA)/hci $(NFA)/int $(NFA)/p2p $(NFA)/rw $(NFA)/sys) [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
NFA.java | 33 /** An NFA (collection of NFAStates) constructed from a grammar. This 34 * NFA is one big machine for entire grammar. Decision points are recorded 36 * the NFA (interpret a decision). 38 public class NFA { 41 /** This NFA represents which grammar? */ 44 /** Which factory created this NFA? */ 49 public NFA(Grammar g) {
|
NFAState.java | 34 /** A state within an NFA. At most 2 transitions emanate from any NFA state. */ 36 // I need to distinguish between NFA decision states for (...)* and (...)+ 37 // during NFA interpretation. 50 /** For o-A->o type NFA tranitions, record the label that leads to this 56 /** Which NFA are we in? */ 57 public NFA nfa = null; field in class:NFAState 63 * the NFA created for them. They both have a loop-exit-or-stay-in 108 public NFAState(NFA nfa) [all...] |
DFAState.java | 38 /** A DFA state represents a set of possible NFA configurations. 40 * to keep track of all possible states the NFA can be in after 43 * subset T of the states of the NFA that are reachable from the 44 * NFA's start state along some path labeled a1a2..an." 45 * In conventional NFA->DFA conversion, therefore, the subset T 47 * NFA could be in. We need to track the alt predicted by each 53 * the underlying LL grammar from which the NFA was derived. 67 public static final int PREDICTED_ALT_UNSET = NFA.INVALID_ALT_NUMBER-1; 87 /** The NFA->DFA algorithm may terminate leaving some states 95 /** Rather than recheck every NFA configuration in a DFA state (afte [all...] |
LL1DFA.java | 54 nfa = decisionStartState.nfa; 55 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState); 80 nfa = decisionStartState.nfa; 81 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState); 107 s.cachedUniquelyPredicatedAlt = NFA.INVALID_ALT_NUMBER; 119 NFAState altLeftEdge = nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt); 121 SemanticContext ctx = nfa.grammar.ll1Analyzer.getPredicates(altStartState); 158 nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt) [all...] |
NFAToDFAConverter.java | 37 /** Code that embodies the NFA conversion to DFA. A new object is needed 42 /** A list of DFA states we still need to process during NFA conversion */ 45 /** While converting NFA, we must track states that 48 * this rule so we can know where to continue looking for NFA 84 !dfa.nfa.grammar.NFAToDFAConversionExternallyAborted() ) 87 if ( dfa.nfa.grammar.composite.watchNFAConversion ) { 89 " ("+d.nfaConfigurations.size()+" nfa states)"); 121 /** From this first NFA state of a decision, create a DFA. 129 * If this DFA is derived from an loop back NFA state, then the first 146 // find the set of NFA states reachable without consumin [all...] |
DFA.java | 40 /** A DFA (converted from a grammar's NFA). 132 /** Each alt in an NFA derived from a grammar must have a DFA state that 149 * NFA to DFA conversion; >1 alt with recursion implies nonregular. 153 /** Which NFA are we converting (well, which piece of the NFA)? */ 154 public NFA nfa; field in class:DFA 229 nfa = decisionStartState.nfa; 230 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState) [all...] |
/packages/apps/Nfc/nci/jni/ |
Android.mk | 2 NFA := $(VOB_COMPONENTS)/nfa 32 $(NFA)/include \ 33 $(NFA)/brcm \
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
TestDFAMatching.java | 31 import org.antlr.analysis.NFA; 52 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER); 79 checkPrediction(dfa,"q", NFA.INVALID_ALT_NUMBER); 92 checkPrediction(dfa,".2", NFA.INVALID_ALT_NUMBER);
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
dot.stg | 34 digraph NFA { 42 nfa(decisionRanks,states,edges,rankdir,startState) ::= << 43 digraph NFA {
|
/external/regex-re2/re2/ |
nfa.cc | 7 // Prog::SearchNFA, an NFA search. 8 // This is an actual NFA like the theorists talk about, 9 // not the pseudo-NFA found in backtracking regexp implementations. 34 class NFA { 36 NFA(Prog* prog); 37 ~NFA(); 125 DISALLOW_EVIL_CONSTRUCTORS(NFA); 128 NFA::NFA(Prog* prog) { 146 NFA::~NFA() [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
ACyclicDFACodeGenerator.java | 95 int EOTPredicts = NFA.INVALID_ALT_NUMBER; 158 if ( EOTPredicts!=NFA.INVALID_ALT_NUMBER ) {
|
CodeGenerator.java | 288 // CREATE NFA FROM GRAMMAR, CREATE DFA FROM NFA [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
Interpreter.java | 114 /** For a given input char stream, try to match against the NFA 116 * it is using an NFA because it uses DFAs at each decision point to 210 /** Fill a list of all NFA states visited during the parse */ 222 actions.enterRule(s.nfa.grammar.getFileName(), start.enclosingRule.name); 231 s.nfa.grammar.getTokenDisplayName(t)); 234 if ( s.getDecisionNumber()>0 && s.nfa.grammar.getNumberOfAltsForDecisionNFA(s)>1 ) { 236 DFA dfa = s.nfa.grammar.getLookaheadDFA(s.getDecisionNumber()); 238 if ( s.nfa.grammar.type!=Grammar.LEXER ) { 241 " input="+s.nfa.grammar.getTokenDisplayName(t)); 246 if ( predictedAlt == NFA.INVALID_ALT_NUMBER ) [all...] |
NFAFactory.java | 43 * will help with speed of conversion and make it easier to view NFA. For 47 /** This factory is attached to a specifc NFA that it is building. 48 * The NFA will be filled up with states and transitions. 50 NFA nfa = null; field in class:NFAFactory 62 public NFAFactory(NFA nfa) { 63 nfa.setFactory(this); 64 this.nfa = nfa; [all...] |
Grammar.java | 293 /** The NFA that represents the grammar with edges labelled with tokens 296 public NFA nfa; field in class:Grammar 463 * do the LL(*) work; NFA->DFA conversion. 479 * Computed during NFA to DFA conversion. 484 * Computed during NFA to DFA conversion. Just walk accept states [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
en.stg | 238 <paths:{ it | alt <it.alt> via NFA path <it.states; separator=","><\n>}> 280 <paths:{ it | alt <it.alt> via NFA path <it.states; separator=","><\n>}>
|
/ndk/sources/host-tools/nawk-20071023/ |
b.c | 75 #define NFA 20 /* cache this many dynamic fa's */ 76 fa *fatab[NFA]; 102 if (nfatab < NFA) { /* room for another */
|
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
TreeToNFAConverter.g | 33 /** Build an NFA from a tree representing an ANTLR grammar. */ 56 /** Which NFA object are we filling in? */ 57 protected NFA nfa = null; 59 /** Which grammar are we converting an NFA for? */ 69 public TreeToNFAConverter(TreeNodeStream input, Grammar g, NFA nfa, NFAFactory factory) { 72 this.nfa = nfa; 77 TreeToNFAConverter other = new TreeToNFAConverter( new CommonTreeNodeStream( t ), grammar, nfa, factory ) [all...] |
/external/antlr/antlr-3.4/lib/ |
antlr-3.4-complete.jar | |
/prebuilts/misc/common/antlr/ |
antlr-3.4-complete.jar | |