/jEdit/tags/jedit-4-0-pre5/bsh/BSHPrimaryExpression.java
Java | 74 lines | 20 code | 8 blank | 46 comment | 3 complexity | a9133cdaf1d8cc9a215183437bcfae85 MD5 | raw file
Possible License(s): BSD-3-Clause, AGPL-1.0, Apache-2.0, LGPL-2.0, LGPL-3.0, GPL-2.0, CC-BY-SA-3.0, LGPL-2.1, GPL-3.0, MPL-2.0-no-copyleft-exception, IPL-1.0
- /*****************************************************************************
- * *
- * This file is part of the BeanShell Java Scripting distribution. *
- * Documentation and updates may be found at http://www.beanshell.org/ *
- * *
- * Sun Public License Notice: *
- * *
- * The contents of this file are subject to the Sun Public License Version *
- * 1.0 (the "License"); you may not use this file except in compliance with *
- * the License. A copy of the License is available at http://www.sun.com *
- * *
- * The Original Code is BeanShell. The Initial Developer of the Original *
- * Code is Pat Niemeyer. Portions created by Pat Niemeyer are Copyright *
- * (C) 2000. All Rights Reserved. *
- * *
- * GNU Public License Notice: *
- * *
- * Alternatively, the contents of this file may be used under the terms of *
- * the GNU Lesser General Public License (the "LGPL"), in which case the *
- * provisions of LGPL are applicable instead of those above. If you wish to *
- * allow use of your version of this file only under the terms of the LGPL *
- * and not to allow others to use your version of this file under the SPL, *
- * indicate your decision by deleting the provisions above and replace *
- * them with the notice and other provisions required by the LGPL. If you *
- * do not delete the provisions above, a recipient may use your version of *
- * this file under either the SPL or the LGPL. *
- * *
- * Patrick Niemeyer (pat@pat.net) *
- * Author of Learning Java, O'Reilly & Associates *
- * http://www.pat.net/~pat/ *
- * *
- *****************************************************************************/
- package bsh;
- class BSHPrimaryExpression extends SimpleNode
- {
- BSHPrimaryExpression(int id) { super(id); }
- /*
- Should contain a prefix expression and any number of suffixes.
- We don't eval( ) any nodes until the suffixes have had an
- opportunity to work through them. This let's the suffixes decide
- how to interpret an ambiguous name (e.g. for the .class operation).
- */
- public Object eval(CallStack callstack, Interpreter interpreter)
- throws EvalError
- {
- Object obj = jjtGetChild(0);
- int n = jjtGetNumChildren();
- for(int i=1; i<n; i++)
- obj = ((BSHPrimarySuffix)jjtGetChild(i)).doSuffix(
- obj, callstack, interpreter);
- /*
- eval the node to an object
- Note: This construct is now necessary where the node may be
- an ambiguous name. If this becomes common we might want to
- make a static method nodeToObject() or something.
- */
- if ( obj instanceof SimpleNode )
- if ( obj instanceof BSHAmbiguousName )
- obj = ((BSHAmbiguousName)obj).toObject(callstack, interpreter);
- else
- obj = ((SimpleNode)obj).eval(callstack, interpreter);
- return obj;
- }
- }