560 //val r = SEQ(ALTS(List(CHAR('a'), CHAR('b'))),ALTS(List(ALTS(List(CHAR('a'), CHAR('a'))), STAR(CHAR('a'))))) |
560 //val r = SEQ(ALTS(List(CHAR('a'), CHAR('b'))),ALTS(List(ALTS(List(CHAR('a'), CHAR('a'))), STAR(CHAR('a'))))) |
561 //val r = SEQ(ALTS(List(CHAR('a'), CHAR('b'))),ALTS(List(CHAR('a'), STAR(CHAR('a')) ) )) |
561 //val r = SEQ(ALTS(List(CHAR('a'), CHAR('b'))),ALTS(List(CHAR('a'), STAR(CHAR('a')) ) )) |
562 val r = ("ab" | ( (("a")%) | "aa") ) |
562 val r = ("ab" | ( (("a")%) | "aa") ) |
563 //val r = ("a"|"b")~("a") |
563 //val r = ("a"|"b")~("a") |
564 val s = "aa" |
564 val s = "aa" |
565 for(i <- 1 to s.length-1){ |
565 for(i <- 0 to s.length-1){ |
566 val ss = s.slice(0, i+1) |
566 val ss = s.slice(0, i+1) |
567 val nangao = bders_simp_rf(ss.toList, internalise(r)) |
567 val nangao = bders_simp_rf(ss.toList, internalise(r)) |
568 val easy = (bders(ss.toList, internalise(r))) |
568 val easy = (bders(ss.toList, internalise(r))) |
|
569 println("iteration starts") |
|
570 println("bders_simp") |
569 println(bits_print(nangao)) |
571 println(bits_print(nangao)) |
570 println() |
572 println() |
|
573 println("bders") |
571 println(bits_print(easy)) |
574 println(bits_print(easy)) |
572 println() |
575 println() |
|
576 println("new simp") |
573 println(bits_print(bsimp_rf(easy))) |
577 println(bits_print(bsimp_rf(easy))) |
574 println() |
578 println("iteration ends") |
575 } |
579 } |
|
580 println("old simp ders") |
576 println(bits_print(bsimp(bders(s.toList, internalise(r))))) |
581 println(bits_print(bsimp(bders(s.toList, internalise(r))))) |
|
582 println("old derssimp") |
577 println(bits_print(ders_simp(internalise(r), s.toList))) |
583 println(bits_print(ders_simp(internalise(r), s.toList))) |
578 } |
584 } |
579 def find_re(){ |
585 def find_re(){ |
580 for (i <- 1 to 10000){ |
586 for (i <- 1 to 10000){ |
581 val r = balanced_struct_gen(3) |
587 val r = balanced_struct_gen(3) |