HomeSort by: relevance | last modified time | path
    Searched refs:Automaton (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
DFAEmitter.cpp 1 //===- DFAEmitter.cpp - Finite state automaton emitter --------------------===//
9 // This class can produce a generic deterministic finite state automaton (DFA),
18 // initial automaton was nondeterministic - it allows mapping back from the DFA
197 class Automaton;
207 Transition(Record *R, Automaton *Parent);
215 class Automaton {
225 Automaton(RecordKeeper &Records, Record *R);
258 Automaton A(Records, R);
265 Automaton::Automaton(RecordKeeper &Records, Record *R
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
DFAPacketizer.h 8 // This class implements a deterministic finite automaton (DFA) based
31 #include "llvm/Support/Automaton.h"
52 Automaton<uint64_t> A;
53 /// For every itinerary, an "action" to apply to the automaton. This removes
58 DFAPacketizer(const InstrItineraryData *InstrItins, Automaton<uint64_t> a,
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Automaton.h 1 //===-- Automaton.h - Support for driving TableGen-produced DFAs ----------===//
12 // For a description of how to define an automaton, see
13 // include/llvm/TableGen/Automaton.td.
18 // through the original NFA. An automaton by default only returns "accepted" or
157 /// A deterministic finite-state automaton. The automaton is defined in
158 /// TableGen; this object drives an automaton defined by tblgen-emitted tables.
160 /// An automaton accepts a sequence of input tokens ("actions"). This class is
162 template <typename ActionT> class Automaton {
181 /// Create an automaton
    [all...]

Completed in 73 milliseconds