Module: Equation
- Includes:
- Treetop::Runtime
- Included in:
- EquationParser
- Defined in:
- lib/equation_grammar.rb,
lib/equation_node_classes.rb
Defined Under Namespace
Modules: Additive0, Additive1, Additive2, ArrayLiteral0, ArrayLiteral1, ArrayLiteral2, ArrayLiteral3, BooleanAnd0, BooleanAnd1, BooleanAnd2, BooleanLiteral0, BooleanLiteral1, Comparison0, Comparison1, Logical0, Logical1, Logical2, MethodCall0, MethodCall1, MethodCall2, MethodCall3, MethodCall4, Multitive0, Multitive1, Multitive2, NilLiteral0, NilLiteral1, NumericLiteral0, NumericLiteral1, NumericLiteral2, NumericLiteral3, RangeLiteral0, RangeLiteral1, Standalone0, Standalone1, StringLiteral0, StringLiteral1, StringLiteral2, Subexpression0, Subexpression1, Symbol0, Symbol1, Symbol2, Symbol3 Classes: ArrayLiteral, BooleanLiteral, NilLiteral, NumericLiteral, RangeLiteral, StringLiteral
Instance Method Summary collapse
- #_nt_additive ⇒ Object
- #_nt_array_literal ⇒ Object
- #_nt_boolean_and ⇒ Object
- #_nt_boolean_literal ⇒ Object
- #_nt_comparison ⇒ Object
- #_nt_expression ⇒ Object
- #_nt_literals ⇒ Object
- #_nt_logical ⇒ Object
- #_nt_method_call ⇒ Object
- #_nt_multitive ⇒ Object
- #_nt_nil_literal ⇒ Object
- #_nt_numeric_literal ⇒ Object
- #_nt_range_literal ⇒ Object
- #_nt_space ⇒ Object
- #_nt_standalone ⇒ Object
- #_nt_string_literal ⇒ Object
- #_nt_subexpression ⇒ Object
- #_nt_symbol ⇒ Object
- #root ⇒ Object
Instance Method Details
#_nt_additive ⇒ Object
587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 |
# File 'lib/equation_grammar.rb', line 587 def _nt_additive start_index = index if node_cache[:additive].has_key?(index) cached = node_cache[:additive][index] if cached node_cache[:additive][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] r1 = _nt_multitive s0 << r1 if r1 s2, i2 = [], index loop do i3, s3 = index, [] r4 = _nt_space s3 << r4 if r4 i5 = index if (match_len = has_terminal?('+', false, index)) r6 = true @index += match_len else terminal_parse_failure('\'+\'') r6 = nil end if r6 r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true r5 = r6 else if (match_len = has_terminal?('-', false, index)) r7 = true @index += match_len else terminal_parse_failure('\'-\'') r7 = nil end if r7 r7 = SyntaxNode.new(input, (index-1)...index) if r7 == true r5 = r7 else @index = i5 r5 = nil end end s3 << r5 if r5 r8 = _nt_space s3 << r8 if r8 r9 = _nt_multitive s3 << r9 end end end if s3.last r3 = instantiate_node(SyntaxNode,input, i3...index, s3) r3.extend(Additive0) else @index = i3 r3 = nil end if r3 s2 << r3 else break end end r2 = instantiate_node(SyntaxNode,input, i2...index, s2) s0 << r2 end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Additive1) r0.extend(Additive2) else @index = i0 r0 = nil end node_cache[:additive][start_index] = r0 r0 end |
#_nt_array_literal ⇒ Object
1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 |
# File 'lib/equation_grammar.rb', line 1676 def _nt_array_literal start_index = index if node_cache[:array_literal].has_key?(index) cached = node_cache[:array_literal][index] if cached node_cache[:array_literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] if (match_len = has_terminal?('[', false, index)) r1 = true @index += match_len else terminal_parse_failure('\'[\'') r1 = nil end s0 << r1 if r1 r2 = _nt_space s0 << r2 if r2 r3 = _nt_space s0 << r3 if r3 i5, s5 = index, [] r7 = _nt_standalone if r7 r6 = r7 else r6 = instantiate_node(SyntaxNode,input, index...index) end s5 << r6 if r6 r8 = _nt_space s5 << r8 if r8 s9, i9 = [], index loop do i10, s10 = index, [] r11 = _nt_space s10 << r11 if r11 if (match_len = has_terminal?(',', false, index)) r12 = true @index += match_len else terminal_parse_failure('\',\'') r12 = nil end s10 << r12 if r12 r13 = _nt_space s10 << r13 if r13 r14 = _nt_standalone s10 << r14 end end end if s10.last r10 = instantiate_node(SyntaxNode,input, i10...index, s10) r10.extend(ArrayLiteral0) else @index = i10 r10 = nil end if r10 s9 << r10 else break end end r9 = instantiate_node(SyntaxNode,input, i9...index, s9) s5 << r9 end end if s5.last r5 = instantiate_node(SyntaxNode,input, i5...index, s5) r5.extend(ArrayLiteral1) else @index = i5 r5 = nil end if r5 r4 = r5 else r4 = instantiate_node(SyntaxNode,input, index...index) end s0 << r4 if r4 if (match_len = has_terminal?(']', false, index)) r15 = true @index += match_len else terminal_parse_failure('\']\'') r15 = nil end s0 << r15 end end end end if s0.last r0 = instantiate_node(ArrayLiteral,input, i0...index, s0) r0.extend(ArrayLiteral2) r0.extend(ArrayLiteral3) else @index = i0 r0 = nil end node_cache[:array_literal][start_index] = r0 r0 end |
#_nt_boolean_and ⇒ Object
247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 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 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 |
# File 'lib/equation_grammar.rb', line 247 def _nt_boolean_and start_index = index if node_cache[:boolean_and].has_key?(index) cached = node_cache[:boolean_and][index] if cached node_cache[:boolean_and][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] i1 = index r2 = _nt_comparison if r2 r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true r1 = r2 else r3 = _nt_additive if r3 r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true r1 = r3 else @index = i1 r1 = nil end end s0 << r1 if r1 r4 = _nt_space s0 << r4 if r4 s5, i5 = [], index loop do i6, s6 = index, [] if (match_len = has_terminal?('&&', false, index)) r7 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'&&\'') r7 = nil end s6 << r7 if r7 r8 = _nt_space s6 << r8 if r8 i9 = index r10 = _nt_comparison if r10 r10 = SyntaxNode.new(input, (index-1)...index) if r10 == true r9 = r10 else r11 = _nt_additive if r11 r11 = SyntaxNode.new(input, (index-1)...index) if r11 == true r9 = r11 else @index = i9 r9 = nil end end s6 << r9 if r9 r12 = _nt_space s6 << r12 end end end if s6.last r6 = instantiate_node(SyntaxNode,input, i6...index, s6) r6.extend(BooleanAnd0) else @index = i6 r6 = nil end if r6 s5 << r6 else break end end r5 = instantiate_node(SyntaxNode,input, i5...index, s5) s0 << r5 end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(BooleanAnd1) r0.extend(BooleanAnd2) else @index = i0 r0 = nil end node_cache[:boolean_and][start_index] = r0 r0 end |
#_nt_boolean_literal ⇒ Object
1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 |
# File 'lib/equation_grammar.rb', line 1501 def _nt_boolean_literal start_index = index if node_cache[:boolean_literal].has_key?(index) cached = node_cache[:boolean_literal][index] if cached node_cache[:boolean_literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] i1 = index if (match_len = has_terminal?("true", false, index)) r2 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('"true"') r2 = nil end if r2 r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true r1 = r2 else if (match_len = has_terminal?("false", false, index)) r3 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('"false"') r3 = nil end if r3 r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true r1 = r3 else @index = i1 r1 = nil end end s0 << r1 if s0.last r0 = instantiate_node(BooleanLiteral,input, i0...index, s0) r0.extend(BooleanLiteral0) r0.extend(BooleanLiteral1) else @index = i0 r0 = nil end node_cache[:boolean_literal][start_index] = r0 r0 end |
#_nt_comparison ⇒ Object
397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 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 |
# File 'lib/equation_grammar.rb', line 397 def _nt_comparison start_index = index if node_cache[:comparison].has_key?(index) cached = node_cache[:comparison][index] if cached node_cache[:comparison][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] r1 = _nt_additive s0 << r1 if r1 r2 = _nt_space s0 << r2 if r2 i3 = index if (match_len = has_terminal?('in', false, index)) r4 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'in\'') r4 = nil end if r4 r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true r3 = r4 else if (match_len = has_terminal?('<=', false, index)) r5 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'<=\'') r5 = nil end if r5 r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true r3 = r5 else if (match_len = has_terminal?('<', false, index)) r6 = true @index += match_len else terminal_parse_failure('\'<\'') r6 = nil end if r6 r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true r3 = r6 else if (match_len = has_terminal?('>=', false, index)) r7 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'>=\'') r7 = nil end if r7 r7 = SyntaxNode.new(input, (index-1)...index) if r7 == true r3 = r7 else if (match_len = has_terminal?('>', false, index)) r8 = true @index += match_len else terminal_parse_failure('\'>\'') r8 = nil end if r8 r8 = SyntaxNode.new(input, (index-1)...index) if r8 == true r3 = r8 else if (match_len = has_terminal?('==', false, index)) r9 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'==\'') r9 = nil end if r9 r9 = SyntaxNode.new(input, (index-1)...index) if r9 == true r3 = r9 else if (match_len = has_terminal?('!=', false, index)) r10 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'!=\'') r10 = nil end if r10 r10 = SyntaxNode.new(input, (index-1)...index) if r10 == true r3 = r10 else if (match_len = has_terminal?('=~', false, index)) r11 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'=~\'') r11 = nil end if r11 r11 = SyntaxNode.new(input, (index-1)...index) if r11 == true r3 = r11 else @index = i3 r3 = nil end end end end end end end end s0 << r3 if r3 r12 = _nt_space s0 << r12 if r12 r13 = _nt_additive s0 << r13 if r13 r14 = _nt_space s0 << r14 end end end end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Comparison0) r0.extend(Comparison1) else @index = i0 r0 = nil end node_cache[:comparison][start_index] = r0 r0 end |
#_nt_expression ⇒ Object
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 |
# File 'lib/equation_grammar.rb', line 11 def _nt_expression start_index = index if node_cache[:expression].has_key?(index) cached = node_cache[:expression][index] if cached node_cache[:expression][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0 = index r1 = _nt_logical if r1 r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true r0 = r1 else r2 = _nt_comparison if r2 r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true r0 = r2 else r3 = _nt_additive if r3 r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true r0 = r3 else r4 = _nt_standalone if r4 r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true r0 = r4 else @index = i0 r0 = nil end end end end node_cache[:expression][start_index] = r0 r0 end |
#_nt_literals ⇒ Object
1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 |
# File 'lib/equation_grammar.rb', line 1187 def _nt_literals start_index = index if node_cache[:literals].has_key?(index) cached = node_cache[:literals][index] if cached node_cache[:literals][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0 = index r1 = _nt_array_literal if r1 r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true r0 = r1 else r2 = _nt_nil_literal if r2 r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true r0 = r2 else r3 = _nt_boolean_literal if r3 r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true r0 = r3 else r4 = _nt_string_literal if r4 r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true r0 = r4 else r5 = _nt_range_literal if r5 r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true r0 = r5 else r6 = _nt_numeric_literal if r6 r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true r0 = r6 else @index = i0 r0 = nil end end end end end end node_cache[:literals][start_index] = r0 r0 end |
#_nt_logical ⇒ Object
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 |
# File 'lib/equation_grammar.rb', line 101 def _nt_logical start_index = index if node_cache[:logical].has_key?(index) cached = node_cache[:logical][index] if cached node_cache[:logical][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] i1 = index r2 = _nt_boolean_and if r2 r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true r1 = r2 else r3 = _nt_additive if r3 r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true r1 = r3 else @index = i1 r1 = nil end end s0 << r1 if r1 r4 = _nt_space s0 << r4 if r4 s5, i5 = [], index loop do i6, s6 = index, [] if (match_len = has_terminal?('||', false, index)) r7 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'||\'') r7 = nil end s6 << r7 if r7 r8 = _nt_space s6 << r8 if r8 i9 = index r10 = _nt_boolean_and if r10 r10 = SyntaxNode.new(input, (index-1)...index) if r10 == true r9 = r10 else r11 = _nt_additive if r11 r11 = SyntaxNode.new(input, (index-1)...index) if r11 == true r9 = r11 else @index = i9 r9 = nil end end s6 << r9 if r9 r12 = _nt_space s6 << r12 end end end if s6.last r6 = instantiate_node(SyntaxNode,input, i6...index, s6) r6.extend(Logical0) else @index = i6 r6 = nil end if r6 s5 << r6 else break end end r5 = instantiate_node(SyntaxNode,input, i5...index, s5) s0 << r5 end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Logical1) r0.extend(Logical2) else @index = i0 r0 = nil end node_cache[:logical][start_index] = r0 r0 end |
#_nt_method_call ⇒ Object
1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 |
# File 'lib/equation_grammar.rb', line 1034 def _nt_method_call start_index = index if node_cache[:method_call].has_key?(index) cached = node_cache[:method_call][index] if cached node_cache[:method_call][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] i1, s1 = index, [] if has_terminal?(@regexps[gr = '\A[a-zA-Z]'] ||= Regexp.new(gr), :regexp, index) r2 = true @index += 1 else terminal_parse_failure('[a-zA-Z]') r2 = nil end s1 << r2 if r2 s3, i3 = [], index loop do if has_terminal?(@regexps[gr = '\A[a-zA-Z0-9_]'] ||= Regexp.new(gr), :regexp, index) r4 = true @index += 1 else terminal_parse_failure('[a-zA-Z0-9_]') r4 = nil end if r4 s3 << r4 else break end end r3 = instantiate_node(SyntaxNode,input, i3...index, s3) s1 << r3 end if s1.last r1 = instantiate_node(SyntaxNode,input, i1...index, s1) r1.extend(MethodCall0) else @index = i1 r1 = nil end s0 << r1 if r1 if (match_len = has_terminal?('(', false, index)) r5 = true @index += match_len else terminal_parse_failure('\'(\'') r5 = nil end s0 << r5 if r5 r6 = _nt_space s0 << r6 if r6 i8, s8 = index, [] r10 = _nt_expression if r10 r9 = r10 else r9 = instantiate_node(SyntaxNode,input, index...index) end s8 << r9 if r9 r11 = _nt_space s8 << r11 if r11 s12, i12 = [], index loop do i13, s13 = index, [] r14 = _nt_space s13 << r14 if r14 if (match_len = has_terminal?(',', false, index)) r15 = true @index += match_len else terminal_parse_failure('\',\'') r15 = nil end s13 << r15 if r15 r16 = _nt_space s13 << r16 if r16 r17 = _nt_expression s13 << r17 end end end if s13.last r13 = instantiate_node(SyntaxNode,input, i13...index, s13) r13.extend(MethodCall1) else @index = i13 r13 = nil end if r13 s12 << r13 else break end end r12 = instantiate_node(SyntaxNode,input, i12...index, s12) s8 << r12 end end if s8.last r8 = instantiate_node(SyntaxNode,input, i8...index, s8) r8.extend(MethodCall2) else @index = i8 r8 = nil end if r8 r7 = r8 else r7 = instantiate_node(SyntaxNode,input, index...index) end s0 << r7 if r7 if (match_len = has_terminal?(')', false, index)) r18 = true @index += match_len else terminal_parse_failure('\')\'') r18 = nil end s0 << r18 end end end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(MethodCall3) r0.extend(MethodCall4) else @index = i0 r0 = nil end node_cache[:method_call][start_index] = r0 r0 end |
#_nt_multitive ⇒ Object
721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 |
# File 'lib/equation_grammar.rb', line 721 def _nt_multitive start_index = index if node_cache[:multitive].has_key?(index) cached = node_cache[:multitive][index] if cached node_cache[:multitive][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] r1 = _nt_standalone s0 << r1 if r1 s2, i2 = [], index loop do i3, s3 = index, [] r4 = _nt_space s3 << r4 if r4 i5 = index if (match_len = has_terminal?('*', false, index)) r6 = true @index += match_len else terminal_parse_failure('\'*\'') r6 = nil end if r6 r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true r5 = r6 else if (match_len = has_terminal?('/', false, index)) r7 = true @index += match_len else terminal_parse_failure('\'/\'') r7 = nil end if r7 r7 = SyntaxNode.new(input, (index-1)...index) if r7 == true r5 = r7 else if (match_len = has_terminal?('%', false, index)) r8 = true @index += match_len else terminal_parse_failure('\'%\'') r8 = nil end if r8 r8 = SyntaxNode.new(input, (index-1)...index) if r8 == true r5 = r8 else @index = i5 r5 = nil end end end s3 << r5 if r5 r9 = _nt_space s3 << r9 if r9 r10 = _nt_standalone s3 << r10 end end end if s3.last r3 = instantiate_node(SyntaxNode,input, i3...index, s3) r3.extend(Multitive0) else @index = i3 r3 = nil end if r3 s2 << r3 else break end end r2 = instantiate_node(SyntaxNode,input, i2...index, s2) s0 << r2 end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Multitive1) r0.extend(Multitive2) else @index = i0 r0 = nil end node_cache[:multitive][start_index] = r0 r0 end |
#_nt_nil_literal ⇒ Object
1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 |
# File 'lib/equation_grammar.rb', line 1567 def _nt_nil_literal start_index = index if node_cache[:nil_literal].has_key?(index) cached = node_cache[:nil_literal][index] if cached node_cache[:nil_literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] i1 = index if (match_len = has_terminal?('nil', false, index)) r2 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'nil\'') r2 = nil end if r2 r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true r1 = r2 else if (match_len = has_terminal?('null', false, index)) r3 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'null\'') r3 = nil end if r3 r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true r1 = r3 else @index = i1 r1 = nil end end s0 << r1 if s0.last r0 = instantiate_node(NilLiteral,input, i0...index, s0) r0.extend(NilLiteral0) r0.extend(NilLiteral1) else @index = i0 r0 = nil end node_cache[:nil_literal][start_index] = r0 r0 end |
#_nt_numeric_literal ⇒ Object
1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 |
# File 'lib/equation_grammar.rb', line 1369 def _nt_numeric_literal start_index = index if node_cache[:numeric_literal].has_key?(index) cached = node_cache[:numeric_literal][index] if cached node_cache[:numeric_literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] i1, s1 = index, [] if (match_len = has_terminal?('-', false, index)) r3 = true @index += match_len else terminal_parse_failure('\'-\'') r3 = nil end if r3 r2 = r3 else r2 = instantiate_node(SyntaxNode,input, index...index) end s1 << r2 if r2 s4, i4 = [], index loop do if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index) r5 = true @index += 1 else terminal_parse_failure('[0-9]') r5 = nil end if r5 s4 << r5 else break end end if s4.empty? @index = i4 r4 = nil else r4 = instantiate_node(SyntaxNode,input, i4...index, s4) end s1 << r4 if r4 i7, s7 = index, [] if (match_len = has_terminal?('.', false, index)) r8 = true @index += match_len else terminal_parse_failure('\'.\'') r8 = nil end s7 << r8 if r8 s9, i9 = [], index loop do if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index) r10 = true @index += 1 else terminal_parse_failure('[0-9]') r10 = nil end if r10 s9 << r10 else break end end if s9.empty? @index = i9 r9 = nil else r9 = instantiate_node(SyntaxNode,input, i9...index, s9) end s7 << r9 end if s7.last r7 = instantiate_node(SyntaxNode,input, i7...index, s7) r7.extend(NumericLiteral0) else @index = i7 r7 = nil end if r7 r6 = r7 else r6 = instantiate_node(SyntaxNode,input, index...index) end s1 << r6 end end if s1.last r1 = instantiate_node(SyntaxNode,input, i1...index, s1) r1.extend(NumericLiteral1) else @index = i1 r1 = nil end s0 << r1 if s0.last r0 = instantiate_node(NumericLiteral,input, i0...index, s0) r0.extend(NumericLiteral2) r0.extend(NumericLiteral3) else @index = i0 r0 = nil end node_cache[:numeric_literal][start_index] = r0 r0 end |
#_nt_range_literal ⇒ Object
1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 |
# File 'lib/equation_grammar.rb', line 1815 def _nt_range_literal start_index = index if node_cache[:range_literal].has_key?(index) cached = node_cache[:range_literal][index] if cached node_cache[:range_literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] r1 = _nt_numeric_literal s0 << r1 if r1 if (match_len = has_terminal?('..', false, index)) r2 = instantiate_node(SyntaxNode,input, index...(index + match_len)) @index += match_len else terminal_parse_failure('\'..\'') r2 = nil end s0 << r2 if r2 r3 = _nt_numeric_literal s0 << r3 end end if s0.last r0 = instantiate_node(RangeLiteral,input, i0...index, s0) r0.extend(RangeLiteral0) r0.extend(RangeLiteral1) else @index = i0 r0 = nil end node_cache[:range_literal][start_index] = r0 r0 end |
#_nt_space ⇒ Object
2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 |
# File 'lib/equation_grammar.rb', line 2003 def _nt_space start_index = index if node_cache[:space].has_key?(index) cached = node_cache[:space][index] if cached node_cache[:space][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end s0, i0 = [], index loop do if has_terminal?(@regexps[gr = '\A[ \\t\\n\\r]'] ||= Regexp.new(gr), :regexp, index) r1 = true @index += 1 else terminal_parse_failure('[ \\t\\n\\r]') r1 = nil end if r1 s0 << r1 else break end end r0 = instantiate_node(SyntaxNode,input, i0...index, s0) node_cache[:space][start_index] = r0 r0 end |
#_nt_standalone ⇒ Object
842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 |
# File 'lib/equation_grammar.rb', line 842 def _nt_standalone start_index = index if node_cache[:standalone].has_key?(index) cached = node_cache[:standalone][index] if cached node_cache[:standalone][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] s1, i1 = [], index loop do if (match_len = has_terminal?('!', false, index)) r2 = true @index += match_len else terminal_parse_failure('\'!\'') r2 = nil end if r2 s1 << r2 else break end end r1 = instantiate_node(SyntaxNode,input, i1...index, s1) s0 << r1 if r1 i3 = index r4 = _nt_symbol if r4 r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true r3 = r4 else r5 = _nt_method_call if r5 r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true r3 = r5 else r6 = _nt_literals if r6 r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true r3 = r6 else r7 = _nt_subexpression if r7 r7 = SyntaxNode.new(input, (index-1)...index) if r7 == true r3 = r7 else @index = i3 r3 = nil end end end end s0 << r3 end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Standalone0) r0.extend(Standalone1) else @index = i0 r0 = nil end node_cache[:standalone][start_index] = r0 r0 end |
#_nt_string_literal ⇒ Object
1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 |
# File 'lib/equation_grammar.rb', line 1259 def _nt_string_literal start_index = index if node_cache[:string_literal].has_key?(index) cached = node_cache[:string_literal][index] if cached node_cache[:string_literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] if (match_len = has_terminal?('"', false, index)) r1 = true @index += match_len else terminal_parse_failure('\'"\'') r1 = nil end s0 << r1 if r1 s2, i2 = [], index loop do i3, s3 = index, [] i4 = index if (match_len = has_terminal?('"', false, index)) r5 = true @index += match_len else terminal_parse_failure('\'"\'') r5 = nil end if r5 @index = i4 r4 = nil terminal_parse_failure('\'"\'', true) else @terminal_failures.pop @index = i4 r4 = instantiate_node(SyntaxNode,input, index...index) end s3 << r4 if r4 if index < input_length r6 = true @index += 1 else terminal_parse_failure("any character") r6 = nil end s3 << r6 end if s3.last r3 = instantiate_node(SyntaxNode,input, i3...index, s3) r3.extend(StringLiteral0) else @index = i3 r3 = nil end if r3 s2 << r3 else break end end r2 = instantiate_node(SyntaxNode,input, i2...index, s2) s0 << r2 if r2 if (match_len = has_terminal?('"', false, index)) r7 = true @index += match_len else terminal_parse_failure('\'"\'') r7 = nil end s0 << r7 end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(StringLiteral1) r0.extend(StringLiteral2) else @index = i0 r0 = nil end node_cache[:string_literal][start_index] = r0 r0 end |
#_nt_subexpression ⇒ Object
928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 |
# File 'lib/equation_grammar.rb', line 928 def _nt_subexpression start_index = index if node_cache[:subexpression].has_key?(index) cached = node_cache[:subexpression][index] if cached node_cache[:subexpression][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] if (match_len = has_terminal?('(', false, index)) r1 = true @index += match_len else terminal_parse_failure('\'(\'') r1 = nil end s0 << r1 if r1 r2 = _nt_expression s0 << r2 if r2 if (match_len = has_terminal?(')', false, index)) r3 = true @index += match_len else terminal_parse_failure('\')\'') r3 = nil end s0 << r3 end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Subexpression0) r0.extend(Subexpression1) else @index = i0 r0 = nil end node_cache[:subexpression][start_index] = r0 r0 end |
#_nt_symbol ⇒ Object
1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 |
# File 'lib/equation_grammar.rb', line 1879 def _nt_symbol start_index = index if node_cache[:symbol].has_key?(index) cached = node_cache[:symbol][index] if cached node_cache[:symbol][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true @index = cached.interval.end end return cached end i0, s0 = index, [] if (match_len = has_terminal?('$', false, index)) r1 = true @index += match_len else terminal_parse_failure('\'$\'') r1 = nil end s0 << r1 if r1 i2, s2 = index, [] if has_terminal?(@regexps[gr = '\A[a-zA-Z]'] ||= Regexp.new(gr), :regexp, index) r3 = true @index += 1 else terminal_parse_failure('[a-zA-Z]') r3 = nil end s2 << r3 if r3 s4, i4 = [], index loop do if has_terminal?(@regexps[gr = '\A[a-zA-Z0-9_]'] ||= Regexp.new(gr), :regexp, index) r5 = true @index += 1 else terminal_parse_failure('[a-zA-Z0-9_]') r5 = nil end if r5 s4 << r5 else break end end r4 = instantiate_node(SyntaxNode,input, i4...index, s4) s2 << r4 end if s2.last r2 = instantiate_node(SyntaxNode,input, i2...index, s2) r2.extend(Symbol0) else @index = i2 r2 = nil end s0 << r2 if r2 s6, i6 = [], index loop do i7, s7 = index, [] if (match_len = has_terminal?('.', false, index)) r8 = true @index += match_len else terminal_parse_failure('\'.\'') r8 = nil end s7 << r8 if r8 s9, i9 = [], index loop do if has_terminal?(@regexps[gr = '\A[a-zA-Z0-9_]'] ||= Regexp.new(gr), :regexp, index) r10 = true @index += 1 else terminal_parse_failure('[a-zA-Z0-9_]') r10 = nil end if r10 s9 << r10 else break end end if s9.empty? @index = i9 r9 = nil else r9 = instantiate_node(SyntaxNode,input, i9...index, s9) end s7 << r9 end if s7.last r7 = instantiate_node(SyntaxNode,input, i7...index, s7) r7.extend(Symbol1) else @index = i7 r7 = nil end if r7 s6 << r7 else break end end r6 = instantiate_node(SyntaxNode,input, i6...index, s6) s0 << r6 end end if s0.last r0 = instantiate_node(SyntaxNode,input, i0...index, s0) r0.extend(Symbol2) r0.extend(Symbol3) else @index = i0 r0 = nil end node_cache[:symbol][start_index] = r0 r0 end |
#root ⇒ Object
7 8 9 |
# File 'lib/equation_grammar.rb', line 7 def root @root ||= :expression end |