Examples of wyautl_old.lang.Automaton

wyautl_old.lang.Automaton

A finite-state automaton for representing Whiley types. This is a machine for accepting matching inputs of a given language. An automaton is a directed graph whose nodes and edges are referred to as states and transitions. Each state has a "kind" which determines how the state behaves on given inputs. For example, a state with "OR" kind might accept an input if either of its children does; in contrast, and state of "AND" kind might accept an input only if all its children does.

The organisation of children is done according to two approaches: deterministic and non-deterministic. In the deterministic approach, the ordering of children is important; in the non-deterministic approach, the ordering of children is not important. A flag is used to indicate whether a state is deterministic or not.

Aside from having a particular kind, each state may also have supplementary material. This can be used, for example, to effectively provide labelled transitions. Another use of this might be to store a given string which must be matched.

NOTE: In the internal representation of automata, leaf states may be not be represented as actual nodes. This will occur if the leaf node does not include any supplementary data, and is primarily for space and performance optimisation. In such case, the node is represented as a child node using a negative index.
@author David J. Pearce

      }
    } else {
      ArrayList<Automaton.State> states = new ArrayList<Automaton.State>();
      HashMap<NameID, Integer> roots = new HashMap<NameID, Integer>();
      resolveAsType(t, context, states, roots, nominal, unconstrained);
      return Type.construct(new Automaton(states));
    }
  }

View Full Code Here

    return myIndex;
  }


  private static int append(Type type, ArrayList<Automaton.State> states) {
    int myIndex = states.size();
    Automaton automaton = Type.destruct(type);
    Automaton.State[] tStates = automaton.states;
    int[] rmap = new int[tStates.length];
    for (int i = 0, j = myIndex; i != rmap.length; ++i, ++j) {
      rmap[i] = j;
    }

View Full Code Here

    public BinaryTypeWriter(BinaryOutputStream output) {
      super(output);
    }


    public void write(Automaton automaton) throws IOException {
      Type t = Type.construct(new Automaton(automaton));
      if (t != Type.T_VOID) {
        super.write(automaton);
        count++;
        if (verbose) {
          System.err.print("\rWrote " + count + " types.");

View Full Code Here

    if (ntyp instanceof Type.Void) {
      return "v";
    }
    if (ntyp instanceof Type.Compound) {
      Type.Compound compound = (Type.Compound) ntyp;
      Automaton automaton = compound.automaton;


      return writeTypeCompound(automaton);
    }
    if (ntyp instanceof Type.Nominal) {
      return "N";              // **** need to fix; had nid

View Full Code Here

    int size = reader.read_uv();
    Automaton.State[] states = new Automaton.State[size];
    for(int i=0;i!=size;++i) {
      states[i] = readState();
    }
    return new Automaton(states);
  }

View Full Code Here

TOP

Related Classes of wyautl_old.lang.Automaton

wyautl_old.io.BinaryAutomataReader

wyc.builder.FlowTypeChecker

wycc.lang.Wyil2CBuilder

wyil.util.type.TypeGenerator$BinaryTypeWriter

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.