Package com.dragome.compiler.ast

Examples of com.dragome.compiler.ast.Block

300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
    String signatureReplaced= normalizeExpression(signature);

    if (typeDecl.getClassName().equals("java.lang.String") && method.isInstanceConstructor())
    {

      Block body= method.getBody();

      body.removeChild(body.getFirstChild());

      MethodInvocation consume= (MethodInvocation) body.getLastChild();
      body.removeChild(consume);

      ReturnStatement r= new ReturnStatement(0, 0);
      r.setExpression((Expression) consume.getArguments().get(0));
      body.appendChild(r);

      print("_dragomeJs.StringInit" + signatureReplaced + " = function(");
      closingString= "};\n";
    }
    else
View Full Code Here
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
  public void visit(TryStatement tryStmt)
  {
    println("try {");
    visit_(tryStmt.getTryBlock());
    indent("} ");
    Block clauses= tryStmt.getCatchStatements();
    CatchClause clause= (CatchClause) clauses.getFirstChild();

    String ex= null;
    if (clause != null)
    {
      ex= clause.getException().getName();
    }

    //  if (clauses.getChildCount() == 1)
    //  {
    //      print("catch(" + ex + ") ");
    //      clause.visit(this);
    //  }
    if (clauses.getChildCount() > 0)
    {
      println("catch(" + ex + ") {");
      depth++;
      indent();
      while (clause != null)
      {
        if (clause.getException().getType() != null)
          print("if (dragomeJs.isInstanceof(" + ex + ", " + normalizeExpression(Utils.getSignature(clause.getException().getType())) + ")) ");
        else
          print("if (true)");

        clause.visit(this);
        clause= (CatchClause) clause.getNextSibling();
        if (clause == null)
          break;
        print(" else ");
      }

      print(" else throw dragomeJs.nullSaveException(" + ex + "); ");

      println("");
      depth--;
      indent("}");
    }

    Block finallyBlock= tryStmt.getFinallyBlock();
    if (finallyBlock != null)
    {
      println(" finally {");
      visit_(finallyBlock);
      indent("}");
View Full Code Here
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
    return getNodes().size();
  }

  public Block reduceDumb()
  {
    Block block= new Block();

    for (Node node : getNodes())
    {
      block.appendChild(node.block);

      if (node.isBranch())
      {
        IfStatement ifStmt= new IfStatement();
        ConditionalEdge cEdge= node.getConditionalEdge(true);
        ifStmt.setExpression(cEdge.getBooleanExpression().getExpression());
        ifStmt.setIfBlock(new Block());
        Block targetBlock= cEdge.target.block;
        ifStmt.getIfBlock().appendChild(new BreakStatement(targetBlock));
        ifStmt.setElseBlock(new Block());
        targetBlock= node.getConditionalEdge(false).target.block;
        ifStmt.getElseBlock().appendChild(new BreakStatement(targetBlock));
        block.appendChild(ifStmt);
      }
      else
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
  {
    int pc= node.getInitialPc();
    for (int i= 0; i < tryStatements.size(); i++)
    {
      TryStatement tryStmt= (TryStatement) tryStatements.get(i);
      Block block= tryStmt.getTryBlock();
      if (pc >= block.getBeginIndex() && pc <= block.getEndIndex())
        return tryStmt;
    }
    return null;
  }
View Full Code Here
336
337
338
339
340
341
342
343
344
345
346
    if (size() != 1)
    {
      //throw new RuntimeException("Could not reduce graph");
    }

    Block block= new Block();

    rollOut(getSource(), block);

    return block;
  }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
    graph.removeNode(tryBodyNode);

    finallyNode= head.getFinallyNode();
    if (finallyNode != null)
    {
      Block b= finallyNode.block;

      b.removeChild(b.getFirstChild());

      b.removeChild(b.getLastChild());
      graph.rerootOutEdges(finallyNode, newNode, false);
      graph.removeInEdges(finallyNode);
      graph.removeNode(finallyNode);
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
    graph.rollOut(tryBodyNode, stmt.getTryBlock());

    if (finallyNode != null)
    {
      stmt.setFinallyBlock(new Block());
      graph.rollOut(finallyNode, stmt.getFinallyBlock());
    }

    CatchClause cc= (CatchClause) stmt.getCatchStatements().getFirstChild();
    Iterator iter= catchNodes.iterator();
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
  }

  void rollOut_(Block block)
  {
    WhileStatement loopStmt= new WhileStatement();
    Block loopBody= new Block();
    loopStmt.setBlock(loopBody);
    loopStmt.setExpression(new BooleanLiteral(true));

    block.appendChild(loopStmt);
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
  }

  void produceJump(Edge edge, Block labeledBlock)
  {
    Node referer= edge.getOrgSource();
    Block breakBlock;
    if (edge instanceof ConditionalEdge)
    {
      ConditionalEdge condEdge= (ConditionalEdge) edge;
      BooleanExpression condExpr= condEdge.getBooleanExpression();
      Expression expr= Optimizer.simplifyBooleanExpression(condExpr.getExpression(), condEdge.isNegate());
      IfStatement ifStmt= new IfStatement();
      ifStmt.setExpression(expr);
      referer.block.appendChild(ifStmt);
      Block ifBlock= new Block();
      ifStmt.setIfBlock(ifBlock);
      breakBlock= ifBlock;
    }
    else
    {
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
    graph.removeNode(tail);
  }

  void rollOut_(Block block)
  {
    Block labeledBlock= block;

    Iterator iter= inEdgesForTail.iterator();
    while (iter.hasNext())
    {
      Edge edge= (Edge) iter.next();
      if (!edge.isGlobal())
        continue;

      if (labeledBlock == block)
      {
        labeledBlock= new Block();
        block.appendChild(labeledBlock);
      }

      produceJump(edge, labeledBlock);
    }
View Full Code Here
TOP

Related Classes of com.dragome.compiler.ast.Block

  • com.dragome.compiler.generators.DragomeJavaScriptGenerator
  • com.dragome.compiler.graph.ControlFlowGraph
  • com.dragome.compiler.graph.Graph
  • com.dragome.compiler.graph.transformation.Loop
  • com.dragome.compiler.graph.transformation.Merge
  • com.dragome.compiler.graph.transformation.Transformation
  • com.dragome.compiler.graph.transformation.Try
  • com.dragome.compiler.parser.Optimizer
  • com.dragome.compiler.parser.Parser
  • com.dragome.compiler.parser.Pass1
    • 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.