Examples of persistence.antlr.collections.impl.Vector

Package persistence.antlr.collections.impl

Examples of persistence.antlr.collections.impl.Vector

persistence.antlr.collections.impl.Vector

  public void gen(ParserGrammar g) throws IOException {


    // if debugging, set up a new vector to keep track of sempred
    //   strings for this grammar
    if (g.debuggingOutput)
      semPreds = new Vector();


    setGrammar(g);
    if (!(grammar instanceof ParserGrammar)) {
      antlrTool.panic("Internal error generating parser");
    }

View Full Code Here

    {
      println("// constructor creation turned of with 'noConstructor' option");
      println("#endif");
    }


    astTypes = new Vector();


    // Generate code for each rule in the grammar
    Enumeration ids = grammar.rules.elements();
    int ruleNum=0;
    while ( ids.hasMoreElements() ) {

View Full Code Here

      println("// constructor creation turned of with 'noConstructor' option");
      println("#endif");
    }
    println("");


    astTypes = new Vector();


    // Generate code for each rule in the grammar
    Enumeration ids = grammar.rules.elements();
    int ruleNum=0;
    String ruleNameInits = "";

View Full Code Here

    println("const char* " + prefix + "tokenNames[] = {");
    tabs++;


    // Walk the token vocabulary and generate a Vector of strings
    // from the tokens.
    Vector v = grammar.tokenManager.getVocabulary();
    for (int i = 0; i < v.size(); i++)
    {
      String s = (String)v.elementAt(i);
      if (s == null)
      {
        s = "<"+String.valueOf(i)+">";
      }
      if ( !s.startsWith("\"") && !s.startsWith("<") ) {

View Full Code Here

    tabs++;
    println("enum {");
    tabs++;


    // Generate a definition for each token type
    Vector v = tm.getVocabulary();


    // Do special tokens manually
    println("EOF_ = " + Token.EOF_TYPE + ",");


    // Move the other special token to the end, so we can solve
    // the superfluous comma problem easily


    for (int i = Token.MIN_USER_TYPE; i < v.size(); i++) {
      String s = (String)v.elementAt(i);
      if (s != null) {
        if ( s.startsWith("\"") ) {
          // a string literal
          StringLiteralSymbol sl = (StringLiteralSymbol)tm.getTokenSymbol(s);
          if ( sl==null ) {

View Full Code Here

    /** Walk the tree looking for all exact subtree matches.  Return
     *  an ASTEnumerator that lets the caller walk the list
     *  of subtree roots found herein.
     */
    public ASTEnumeration findAll(AST target) {
        Vector roots = new Vector(10);
        AST sibling;


        // the empty tree cannot result in an enumeration
        if (target == null) {
            return null;

View Full Code Here

    /** Walk the tree looking for all subtrees.  Return
     *  an ASTEnumerator that lets the caller walk the list
     *  of subtree roots found herein.
     */
    public ASTEnumeration findAllPartial(AST sub) {
        Vector roots = new Vector(10);
        AST sibling;


        // the empty tree cannot result in an enumeration
        if (sub == null) {
            return null;

View Full Code Here

    protected Vector handlers;




    public ExceptionSpec(Token label_) {
        label = label_;
        handlers = new Vector();
    }

View Full Code Here

    Token t=null;
    Token t2=null;
    
      StringBuffer buf = new StringBuffer();
      int n=0;
      Vector terms = new Vector(10);
    
    
    _saveIndex=text.length();
    match('(');
    text.setLength(_saveIndex);
    {
    switch ( LA(1)) {
    case '\t':  case '\n':  case '\r':  case ' ':
    {
      _saveIndex=text.length();
      mWS(false);
      text.setLength(_saveIndex);
      break;
    }
    case '"':  case '#':  case '(':  case 'A':
    case 'B':  case 'C':  case 'D':  case 'E':
    case 'F':  case 'G':  case 'H':  case 'I':
    case 'J':  case 'K':  case 'L':  case 'M':
    case 'N':  case 'O':  case 'P':  case 'Q':
    case 'R':  case 'S':  case 'T':  case 'U':
    case 'V':  case 'W':  case 'X':  case 'Y':
    case 'Z':  case '[':  case '_':  case 'a':
    case 'b':  case 'c':  case 'd':  case 'e':
    case 'f':  case 'g':  case 'h':  case 'i':
    case 'j':  case 'k':  case 'l':  case 'm':
    case 'n':  case 'o':  case 'p':  case 'q':
    case 'r':  case 's':  case 't':  case 'u':
    case 'v':  case 'w':  case 'x':  case 'y':
    case 'z':
    {
      break;
    }
    default:
    {
      throw new NoViableAltForCharException((char)LA(1), getFilename(), getLine(), getColumn());
    }
    }
    }
    _saveIndex=text.length();
    mTREE_ELEMENT(true);
    text.setLength(_saveIndex);
    t=_returnToken;
    terms.appendElement(t.getText());
    {
    switch ( LA(1)) {
    case '\t':  case '\n':  case '\r':  case ' ':
    {
      _saveIndex=text.length();
      mWS(false);
      text.setLength(_saveIndex);
      break;
    }
    case ')':  case ',':
    {
      break;
    }
    default:
    {
      throw new NoViableAltForCharException((char)LA(1), getFilename(), getLine(), getColumn());
    }
    }
    }
    {
    _loop407:
    do {
      if ((LA(1)==',')) {
        _saveIndex=text.length();
        match(',');
        text.setLength(_saveIndex);
        {
        switch ( LA(1)) {
        case '\t':  case '\n':  case '\r':  case ' ':
        {
          _saveIndex=text.length();
          mWS(false);
          text.setLength(_saveIndex);
          break;
        }
        case '"':  case '#':  case '(':  case 'A':
        case 'B':  case 'C':  case 'D':  case 'E':
        case 'F':  case 'G':  case 'H':  case 'I':
        case 'J':  case 'K':  case 'L':  case 'M':
        case 'N':  case 'O':  case 'P':  case 'Q':
        case 'R':  case 'S':  case 'T':  case 'U':
        case 'V':  case 'W':  case 'X':  case 'Y':
        case 'Z':  case '[':  case '_':  case 'a':
        case 'b':  case 'c':  case 'd':  case 'e':
        case 'f':  case 'g':  case 'h':  case 'i':
        case 'j':  case 'k':  case 'l':  case 'm':
        case 'n':  case 'o':  case 'p':  case 'q':
        case 'r':  case 's':  case 't':  case 'u':
        case 'v':  case 'w':  case 'x':  case 'y':
        case 'z':
        {
          break;
        }
        default:
        {
          throw new NoViableAltForCharException((char)LA(1), getFilename(), getLine(), getColumn());
        }
        }
        }
        _saveIndex=text.length();
        mTREE_ELEMENT(true);
        text.setLength(_saveIndex);
        t2=_returnToken;
        terms.appendElement(t2.getText());
        {
        switch ( LA(1)) {
        case '\t':  case '\n':  case '\r':  case ' ':
        {
          _saveIndex=text.length();

View Full Code Here


    SimpleTokenManager(String name_, Tool tool_) {
        antlrTool = tool_;
        name = name_;
        // Don't make a bigger vector than we need, because it will show up in output sets.
        vocabulary = new Vector(1);
        table = new Hashtable();


        // define EOF symbol
        TokenSymbol ts = new TokenSymbol("EOF");
        ts.setTokenType(Token.EOF_TYPE);

View Full Code Here

0 1 2 3

TOP

Related Classes of persistence.antlr.collections.impl.Vector

persistence.antlr.actions.cpp.ActionLexer

persistence.antlr.actions.csharp.ActionLexer

persistence.antlr.actions.java.ActionLexer

persistence.antlr.AlternativeBlock

persistence.antlr.BaseAST

persistence.antlr.CodeGenerator

persistence.antlr.collections.impl.IndexedVector

persistence.antlr.CppCodeGenerator

persistence.antlr.CSharpCodeGenerator

persistence.antlr.DiagnosticCodeGenerator

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.