Package org.antlr.v4.runtime.atn

Examples of org.antlr.v4.runtime.atn.PredictionContext

348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
      "}\n";
    assertEquals(expecting, toDOTString(r, rootIsWildcard()));
  }

  @Test public void test_ax_bx() {
    PredictionContext x1 = x();
    PredictionContext x2 = x();
    PredictionContext a = createSingleton(x1, 1);
    PredictionContext b = createSingleton(x2, 2);
    PredictionContext r = PredictionContext.merge(a, b, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>\"];\n" +
View Full Code Here
368
369
370
371
372
373
374
375
376
377
378
379
380
      "}\n";
    assertEquals(expecting, toDOTString(r, rootIsWildcard()));
  }

  @Test public void test_ax_by() {
    PredictionContext a = createSingleton(x(), 1);
    PredictionContext b = createSingleton(y(), 2);
    PredictionContext r = PredictionContext.merge(a, b, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>\"];\n" +
View Full Code Here
388
389
390
391
392
393
394
395
396
397
398
399
400
401
      "}\n";
    assertEquals(expecting, toDOTString(r, rootIsWildcard()));
  }

  @Test public void test_a$_bx() {
    PredictionContext x2 = x();
    PredictionContext a = a();
    PredictionContext b = createSingleton(x2, 2);
    PredictionContext r = PredictionContext.merge(a, b, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>\"];\n" +
View Full Code Here
407
408
409
410
411
412
413
414
415
416
417
418
419
420
      "}\n";
    assertEquals(expecting, toDOTString(r, rootIsWildcard()));
  }

  @Test public void test_a$_bx_fullctx() {
    PredictionContext x2 = x();
    PredictionContext a = a();
    PredictionContext b = createSingleton(x2, 2);
    PredictionContext r = PredictionContext.merge(a, b, fullCtx(), null);
    System.out.println(toDOTString(r, fullCtx()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>\"];\n" +
View Full Code Here
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
  }

  @Ignore("Known inefficiency but deferring resolving the issue for now")
  @Test public void test_aex_bfx() {
    // TJP: this is inefficient as it leaves the top x nodes unmerged.
    PredictionContext x1 = x();
    PredictionContext x2 = x();
    PredictionContext e = createSingleton(x1, 5);
    PredictionContext f = createSingleton(x2, 6);
    PredictionContext a = createSingleton(e, 1);
    PredictionContext b = createSingleton(f, 2);
    PredictionContext r = PredictionContext.merge(a, b, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>\"];\n" +
View Full Code Here
458
459
460
461
462
463
464
465
466
467
468
  // Array merges

  @Test public void test_A$_A$_fullctx() {
    ArrayPredictionContext A1 = array(PredictionContext.EMPTY);
    ArrayPredictionContext A2 = array(PredictionContext.EMPTY);
    PredictionContext r = PredictionContext.merge(A1, A2, fullCtx(), null);
    System.out.println(toDOTString(r, fullCtx()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[label=\"$\"];\n" +
View Full Code Here
474
475
476
477
478
479
480
481
482
483
484
    SingletonPredictionContext a = a();
    SingletonPredictionContext b = b();
    SingletonPredictionContext c = c();
    ArrayPredictionContext A1 = array(a, b);
    ArrayPredictionContext A2 = array(c);
    PredictionContext r = PredictionContext.merge(A1, A2, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>|<p2>\"];\n" +
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
  @Test public void test_Aa_Aa() {
    SingletonPredictionContext a1 = a();
    SingletonPredictionContext a2 = a();
    ArrayPredictionContext A1 = array(a1);
    ArrayPredictionContext A2 = array(a2);
    PredictionContext r = PredictionContext.merge(A1, A2, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[label=\"0\"];\n" +
View Full Code Here
511
512
513
514
515
516
517
518
519
520
521
    SingletonPredictionContext a = a();
    SingletonPredictionContext b = b();
    SingletonPredictionContext c = c();
    ArrayPredictionContext A1 = array(a);
    ArrayPredictionContext A2 = array(b, c);
    PredictionContext r = PredictionContext.merge(A1, A2, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>|<p2>\"];\n" +
View Full Code Here
531
532
533
534
535
536
537
538
539
540
541
    SingletonPredictionContext a = a();
    SingletonPredictionContext b = b();
    SingletonPredictionContext c = c();
    ArrayPredictionContext A1 = array(a, c);
    ArrayPredictionContext A2 = array(b);
    PredictionContext r = PredictionContext.merge(A1, A2, rootIsWildcard(), null);
    System.out.println(toDOTString(r, rootIsWildcard()));
    String expecting =
      "digraph G {\n" +
      "rankdir=LR;\n" +
      "  s0[shape=record, label=\"<p0>|<p1>|<p2>\"];\n" +
View Full Code Here
TOP

Related Classes of org.antlr.v4.runtime.atn.PredictionContext

  • org.antlr.runtime.ANTLRFileStream
  • org.antlr.runtime.ANTLRStringStream
  • org.antlr.runtime.CharStream
  • org.antlr.runtime.CommonToken
  • org.antlr.runtime.tree.CommonTree
  • org.antlr.runtime.tree.CommonTreeNodeStream
  • org.antlr.runtime.tree.Tree
  • org.antlr.runtime.tree.TreeVisitor
  • org.antlr.runtime.tree.TreeVisitorAction
  • org.antlr.v4.analysis.LeftRecursionDetector
    • 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.