Package ptolemy.data.expr

Examples of ptolemy.data.expr.Token

1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
        //ptolemy.data.Token result = tokens[0];
        ptolemy.data.Token childToken = _evaluateChild(node, 0);
        result += _childCode;

        for (int i = 1; i < numChildren; i++) {
            Token operator = (Token) lexicalTokenList.get(i - 1);

            if (operator.kind == PtParserConstants.MULTIPLY) {
                //_fireCode.append("*");
                result += "*";
            } else if (operator.kind == PtParserConstants.DIVIDE) {
View Full Code Here
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
        String result = "";

        int numChildren = node.jjtGetNumChildren();
        _assert(numChildren == 2, node, "The number of child nodes must be two");

        Token operator = node.getOperator();
        ptolemy.data.Token leftToken = _evaluateChild(node, 0);
        result += _childCode;

        if (operator.kind == PtParserConstants.EQUALS) {
            //_fireCode.append(" == ");
View Full Code Here
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
        //ptolemy.data.Token[] tokens = _evaluateAllChildren(node);
        int numChildren = node.jjtGetNumChildren();
        _assert(numChildren == 2, node, "The number of child nodes must be two");

        Token operator = node.getOperator();

        //ptolemy.data.Token token = tokens[0];
        //ptolemy.data.Token bitsToken = tokens[1];

        //_fireCode.append("(");
View Full Code Here
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
        for (int i = 1; i < numChildren; i++) {
            childType = CodeGeneratorHelper.codeGenType(((ASTPtRootNode) node
                    .jjtGetChild(i)).getType());

            Token operator = (Token) lexicalTokenList.get(i - 1);

            //ptolemy.data.Token nextToken = tokens[i];
            if (operator.kind == PtParserConstants.PLUS) {
                result = "$add_" + nodeType + "_" + childType + "(" + result
                        + ", ";
View Full Code Here
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
        //ptolemy.data.Token result = tokens[0];
        ptolemy.data.Token childToken = _evaluateChild(node, 0);
        result += _childCode;

        for (int i = 1; i < numChildren; i++) {
            Token operator = (Token) lexicalTokenList.get(i - 1);

            if (operator.kind == PtParserConstants.MULTIPLY) {
                //_fireCode.append("*");
                result += "*";
            } else if (operator.kind == PtParserConstants.DIVIDE) {
View Full Code Here
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
        String result = "";

        int numChildren = node.jjtGetNumChildren();
        _assert(numChildren == 2, node, "The number of child nodes must be two");

        Token operator = node.getOperator();
        ptolemy.data.Token leftToken = _evaluateChild(node, 0);
        result += _childCode;

        if (operator.kind == PtParserConstants.EQUALS) {
            //_fireCode.append(" == ");
View Full Code Here
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
        //ptolemy.data.Token[] tokens = _evaluateAllChildren(node);
        int numChildren = node.jjtGetNumChildren();
        _assert(numChildren == 2, node, "The number of child nodes must be two");

        Token operator = node.getOperator();

        //ptolemy.data.Token token = tokens[0];
        //ptolemy.data.Token bitsToken = tokens[1];

        //_fireCode.append("(");
View Full Code Here
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
        for (int i = 1; i < numChildren; i++) {
            childType = CodeGeneratorHelper.codeGenType(((ASTPtRootNode) node
                    .jjtGetChild(i)).getType());

            Token operator = (Token) lexicalTokenList.get(i - 1);

            //ptolemy.data.Token nextToken = tokens[i];
            if (operator.kind == PtParserConstants.PLUS) {
                result = "$add_" + nodeType + "_" + childType + "(" + result
                        + ", ";
View Full Code Here
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
                        + "not equal to number of operators plus one");

        Local resultLocal = (Local) _nodeToLocal.get(node.jjtGetChild(0));

        for (int i = 1; i < numChildren; i++) {
            Token operator = (Token) lexicalTokenList.get(i - 1);
            Local nextLocal = (Local) _nodeToLocal.get(node.jjtGetChild(i));

            if (operator.kind == PtParserConstants.MULTIPLY) {
                _units.insertBefore(Jimple.v().newAssignStmt(
                        tokenLocal,
View Full Code Here
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
        _generateAllChildren(node);

        int numChildren = node.jjtGetNumChildren();
        _assert(numChildren == 2, node, "The number of child nodes must be two");

        Token operator = (Token) node.getOperator();
        Local leftLocal = (Local) _nodeToLocal.get(node.jjtGetChild(0));
        Local rightLocal = (Local) _nodeToLocal.get(node.jjtGetChild(1));

        Type scalarType = RefType.v("ptolemy.data.ScalarToken");
        Local tokenLocal = Jimple.v().newLocal("token",
View Full Code Here
TOP

Related Classes of ptolemy.data.expr.Token

  • ptolemy.codegen.c.kernel.CParseTreeCodeGenerator
  • ptolemy.codegen.SystemC.kernel.SystemCParseTreeCodeGenerator
  • ptolemy.copernicus.java.ParseTreeCodeGenerator
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.