Examples of org.antlr.tool.Interpreter.scan()

org.antlr.tool.Interpreter.scan()
For a given input char stream, try to match against the NFA starting at startRule. This is a deterministic parse even though it is using an NFA because it uses DFAs at each decision point to predict which alternative will succeed. This is exactly what the generated parser will do. This only does lexer grammars. Return the token type associated with the final rule end state.

    assertEquals(result.getType(), Atype);
        engine = new Interpreter(g, new ANTLRStringStream("b"));
    result = engine.scan("A");
    assertEquals(result.getType(), Atype);
        engine = new Interpreter(g, new ANTLRStringStream("baa"));
    result = engine.scan("A");
    assertEquals(result.getType(), Atype);
    }


  public void testSimpleLoops() throws Exception {
    Grammar g = new Grammar(

View Full Code Here

        "lexer grammar t;\n"+
        "A : ('0'..'9')+ '.' ('0'..'9')* | ('0'..'9')+ ;\n");
    final int Atype = g.getTokenType("A");
    CharStream input = new ANTLRStringStream("1234.5");
    Interpreter engine = new Interpreter(g, input);
    Token result = engine.scan("A");
    assertEquals(result.getType(), Atype);
  }


  public void testTokensRules() throws Exception {
    Grammar pg = new Grammar(

View Full Code Here

0 1 2 3 4 5

TOP

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.