calabash-android 0.5.2 → 0.5.3

data/test-server/instrumentation-backend/src/org/antlr/runtime/tree/TreePatternLexer.java

@@ -1,135 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2005-2009 Terence Parr
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-     notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-     notice, this list of conditions and the following disclaimer in the
-     documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-     derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-package org.antlr.runtime.tree;
-
-public class TreePatternLexer {
-	public static final int EOF = -1;
-	public static final int BEGIN = 1;
-	public static final int END = 2;
-	public static final int ID = 3;
-	public static final int ARG = 4;
-	public static final int PERCENT = 5;
-	public static final int COLON = 6;
-	public static final int DOT = 7;
-
-	/** The tree pattern to lex like "(A B C)" */
-	protected String pattern;
-
-	/** Index into input string */
-	protected int p = -1;
-
-	/** Current char */
-	protected int c;
-
-	/** How long is the pattern in char? */
-	protected int n;
-
-	/** Set when token type is ID or ARG (name mimics Java's StreamTokenizer) */
-	public StringBuffer sval = new StringBuffer();
-
-	public boolean error = false;
-
-	public TreePatternLexer(String pattern) {
-		this.pattern = pattern;
-		this.n = pattern.length();
-		consume();
-	}
-
-	public int nextToken() {
-		sval.setLength(0); // reset, but reuse buffer
-		while ( c != EOF ) {
-			if ( c==' ' || c=='\n' || c=='\r' || c=='\t' ) {
-				consume();
-				continue;
-			}
-			if ( (c>='a' && c<='z') || (c>='A' && c<='Z') || c=='_' ) {
-				sval.append((char)c);
-				consume();
-				while ( (c>='a' && c<='z') || (c>='A' && c<='Z') ||
-						(c>='0' && c<='9') || c=='_' )
-				{
-					sval.append((char)c);
-					consume();
-				}
-				return ID;
-			}
-			if ( c=='(' ) {
-				consume();
-				return BEGIN;
-			}
-			if ( c==')' ) {
-				consume();
-				return END;
-			}
-			if ( c=='%' ) {
-				consume();
-				return PERCENT;
-			}
-			if ( c==':' ) {
-				consume();
-				return COLON;
-			}
-			if ( c=='.' ) {
-				consume();
-				return DOT;
-			}
-			if ( c=='[' ) { // grab [x] as a string, returning x
-				consume();
-				while ( c!=']' ) {
-					if ( c=='\\' ) {
-						consume();
-						if ( c!=']' ) {
-							sval.append('\\');
-						}
-						sval.append((char)c);
-					}
-					else {
-						sval.append((char)c);
-					}
-					consume();
-				}
-				consume();
-				return ARG;
-			}
-			consume();
-			error = true;
-			return EOF;
-		}
-		return EOF;
-	}
-
-	protected void consume() {
-		p++;
-		if ( p>=n ) {
-			c = EOF;
-		}
-		else {
-			c = pattern.charAt(p);
-		}
-	}
-}

data/test-server/instrumentation-backend/src/org/antlr/runtime/tree/TreePatternParser.java

@@ -1,154 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2005-2009 Terence Parr
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-     notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-     notice, this list of conditions and the following disclaimer in the
-     documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-     derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-package org.antlr.runtime.tree;
-
-import org.antlr.runtime.Token;
-import org.antlr.runtime.CommonToken;
-
-public class TreePatternParser {
-	protected TreePatternLexer tokenizer;
-	protected int ttype;
-	protected TreeWizard wizard;
-	protected TreeAdaptor adaptor;
-
-	public TreePatternParser(TreePatternLexer tokenizer, TreeWizard wizard, TreeAdaptor adaptor) {
-		this.tokenizer = tokenizer;
-		this.wizard = wizard;
-		this.adaptor = adaptor;
-		ttype = tokenizer.nextToken(); // kickstart
-	}
-
-	public Object pattern() {
-		if ( ttype==TreePatternLexer.BEGIN ) {
-			return parseTree();
-		}
-		else if ( ttype==TreePatternLexer.ID ) {
-			Object node = parseNode();
-			if ( ttype==TreePatternLexer.EOF ) {
-				return node;
-			}
-			return null; // extra junk on end
-		}
-		return null;
-	}
-
-	public Object parseTree() {
-		if ( ttype != TreePatternLexer.BEGIN ) {
-			throw new RuntimeException("no BEGIN");
-		}
-		ttype = tokenizer.nextToken();
-		Object root = parseNode();
-		if ( root==null ) {
-			return null;
-		}
-		while ( ttype==TreePatternLexer.BEGIN ||
-				ttype==TreePatternLexer.ID ||
-				ttype==TreePatternLexer.PERCENT ||
-				ttype==TreePatternLexer.DOT )
-		{
-			if ( ttype==TreePatternLexer.BEGIN ) {
-				Object subtree = parseTree();
-				adaptor.addChild(root, subtree);
-			}
-			else {
-				Object child = parseNode();
-				if ( child==null ) {
-					return null;
-				}
-				adaptor.addChild(root, child);
-			}
-		}
-		if ( ttype != TreePatternLexer.END ) {
-			throw new RuntimeException("no END");
-		}
-		ttype = tokenizer.nextToken();
-		return root;
-	}
-
-	public Object parseNode() {
-		// "%label:" prefix
-		String label = null;
-		if ( ttype == TreePatternLexer.PERCENT ) {
-			ttype = tokenizer.nextToken();
-			if ( ttype != TreePatternLexer.ID ) {
-				return null;
-			}
-			label = tokenizer.sval.toString();
-			ttype = tokenizer.nextToken();
-			if ( ttype != TreePatternLexer.COLON ) {
-				return null;
-			}
-			ttype = tokenizer.nextToken(); // move to ID following colon
-		}
-
-		// Wildcard?
-		if ( ttype == TreePatternLexer.DOT ) {
-			ttype = tokenizer.nextToken();
-			Token wildcardPayload = new CommonToken(0, ".");
-			TreeWizard.TreePattern node =
-				new TreeWizard.WildcardTreePattern(wildcardPayload);
-			if ( label!=null ) {
-				node.label = label;
-			}
-			return node;
-		}
-
-		// "ID" or "ID[arg]"
-		if ( ttype != TreePatternLexer.ID ) {
-			return null;
-		}
-		String tokenName = tokenizer.sval.toString();
-		ttype = tokenizer.nextToken();
-		if ( tokenName.equals("nil") ) {
-			return adaptor.nil();
-		}
-		String text = tokenName;
-		// check for arg
-		String arg = null;
-		if ( ttype == TreePatternLexer.ARG ) {
-			arg = tokenizer.sval.toString();
-			text = arg;
-			ttype = tokenizer.nextToken();
-		}
-		
-		// create node
-		int treeNodeType = wizard.getTokenType(tokenName);
-		if ( treeNodeType==Token.INVALID_TOKEN_TYPE ) {
-			return null;
-		}
-		Object node;
-		node = adaptor.create(treeNodeType, text);
-		if ( label!=null && node.getClass()==TreeWizard.TreePattern.class ) {
-			((TreeWizard.TreePattern)node).label = label;
-		}
-		if ( arg!=null && node.getClass()==TreeWizard.TreePattern.class ) {
-			((TreeWizard.TreePattern)node).hasTextArg = true;
-		}
-		return node;
-	}
-}

data/test-server/instrumentation-backend/src/org/antlr/runtime/tree/TreeRewriter.java

@@ -1,124 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2005-2009 Terence Parr
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-     notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-     notice, this list of conditions and the following disclaimer in the
-     documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-     derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-package org.antlr.runtime.tree;
-
-import org.antlr.runtime.RecognizerSharedState;
-import org.antlr.runtime.RecognitionException;
-import org.antlr.runtime.TokenStream;
-
-public class TreeRewriter extends TreeParser {
-
-    private static final String TAG = "ANTLR:TREE:TreeRewriter";
-
-    public interface fptr {
-        public Object rule() throws RecognitionException;
-    }
-
-    protected boolean showTransformations = false;
-
-    protected TokenStream originalTokenStream;
-    protected TreeAdaptor originalAdaptor;
-    
-    public TreeRewriter(TreeNodeStream input) {
-        this(input, new RecognizerSharedState());
-    }
-    public TreeRewriter(TreeNodeStream input, RecognizerSharedState state) {
-        super(input, state);
-        originalAdaptor = input.getTreeAdaptor();
-        originalTokenStream = input.getTokenStream();        
-    }
-
-    public Object applyOnce(Object t, fptr whichRule) {
-        if ( t==null ) return null;
-        try {
-            // share TreeParser object but not parsing-related state
-            state = new RecognizerSharedState();
-            input = new CommonTreeNodeStream(originalAdaptor, t);
-            ((CommonTreeNodeStream)input).setTokenStream(originalTokenStream);
-            setBacktrackingLevel(1);
-            TreeRuleReturnScope r = (TreeRuleReturnScope)whichRule.rule();
-            setBacktrackingLevel(0);
-            if ( failed() ) return t;
-            if ( showTransformations &&
-                 r!=null && !t.equals(r.getTree()) && r.getTree()!=null )
-            {
-                reportTransformation(t, r.getTree());
-            }
-            if ( r!=null && r.getTree()!=null ) return r.getTree();
-            else return t;
-        }
-        catch (RecognitionException e) { ; }
-        return t;
-    }
-
-    public Object applyRepeatedly(Object t, fptr whichRule) {
-        boolean treeChanged = true;
-        while ( treeChanged ) {
-            Object u = applyOnce(t, whichRule);
-            treeChanged = !t.equals(u);
-            t = u;
-        }
-        return t;
-    }
-
-    public Object downup(Object t) { return downup(t, false); }
-
-    public Object downup(Object t, boolean showTransformations) {
-        this.showTransformations = showTransformations;
-        TreeVisitor v = new TreeVisitor(new CommonTreeAdaptor());
-        TreeVisitorAction actions = new TreeVisitorAction() {
-            public Object pre(Object t)  { return applyOnce(t, topdown_fptr); }
-            public Object post(Object t) { return applyRepeatedly(t, bottomup_ftpr); }
-        };
-        t = v.visit(t, actions);
-        return t;
-    }
-
-    /** Override this if you need transformation tracing to go somewhere
-     *  other than stdout or if you're not using Tree-derived trees.
-     */
-    public void reportTransformation(Object oldTree, Object newTree) {
-        //System.out.println(((Tree)oldTree).toStringTree()+" -> "+
-                           //((Tree)newTree).toStringTree());
-	android.util.Log.i(TAG, ((Tree)oldTree).toStringTree()+" -> "+((Tree)newTree).toStringTree());
-    }
-
-    fptr topdown_fptr = new fptr() {
-        public Object rule() throws RecognitionException { return topdown(); }
-    };
-    
-    fptr bottomup_ftpr = new fptr() {
-        public Object rule() throws RecognitionException { return bottomup(); }
-    };
-
-    // methods the downup strategy uses to do the up and down rules.
-    // to override, just define tree grammar rule topdown and turn on
-    // filter=true.
-    public Object topdown() throws RecognitionException { return null; }
-    public Object bottomup() throws RecognitionException { return null; }
-}

data/test-server/instrumentation-backend/src/org/antlr/runtime/tree/TreeRuleReturnScope.java

@@ -1,41 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2005-2009 Terence Parr
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-     notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-     notice, this list of conditions and the following disclaimer in the
-     documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-     derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-package org.antlr.runtime.tree;
-
-import org.antlr.runtime.RuleReturnScope;
-
-/** This is identical to the ParserRuleReturnScope except that
- *  the start property is a tree nodes not Token object
- *  when you are parsing trees.  To be generic the tree node types
- *  have to be Object.
- */
-public class TreeRuleReturnScope extends RuleReturnScope {
-	/** First node or root node of tree matched for this rule. */
-	public Object start;
-	public Object getStart() { return start; }	
-}