6# 4f: parsing (rule builders)
10ordered `++list` as atom of a `++base`.
33 =|({p/@ q/@} |.((add p (mul wuc q))))
41 > (scan "123" (bass 10 (star dit)))
43 > (scan "123" (bass 8 (star dit)))
45 > `@ub`(scan "123" (bass 8 (star dit)))
56Ordered `++list` as atom of a `++base`.
79 =|({p/@ q/@} |.((add p (mul wuc q))))
86 > (scan "123" (boss 10 (star dit)))
88 > `@t`(scan "bam" (boss 256 (star alp)))
90 > `@ux`(scan "bam" (boss 256 (star alp)))
99Parser modifier. Accepts a `++rule` `sef` and produces a parser that
100produces a constant `cus`, assuming `sef` is successful.
105`cus` is a constant noun.
117 ++ cold :: replace w+ constant
125 [p=p.vex q=[~ u=[p=cus q=q.u.q.vex]]]
130 > ((cold %foo (just 'a')) [[1 1] "abc"])
131 [p=[p=1 q=2] q=[~ u=[p=%foo q=[p=[p=1 q=2] q="bc"]]]]
132 > ((cold %foo (just 'a')) [[1 1] "bc"])
142Parser modifier. Produces a parser that takes a (successful) result of a
143`++rule` `sef` and slams it through `poq`.
160 ++ cook :: apply gate
162 |* {poq/$-(* *) sef/rule}
168 [p=p.vex q=[~ u=[p=(poq p.u.q.vex) q=q.u.q.vex]]]
174 > ((cook ,@ud (just 'a')) [[1 1] "abc"])
175 [p=[p=1 q=2] q=[~ u=[p=97 q=[p=[p=1 q=2] q="bc"]]]]
176 > ((cook ,@tas (just 'a')) [[1 1] "abc"])
177 [p=[p=1 q=2] q=[~ u=[p=%a q=[p=[p=1 q=2] q="bc"]]]]
178 > ((cook |=(a=@ +(a)) (just 'a')) [[1 1] "abc"])
179 [p=[p=1 q=2] q=[~ u=[p=98 q=[p=[p=1 q=2] q="bc"]]]]
180 > ((cook |=(a=@ `@t`+(a)) (just 'a')) [[1 1] "abc"])
181 [p=[p=1 q=2] q=[~ u=[p='b' q=[p=[p=1 q=2] q="bc"]]]]
190Parser generator. Produces a parser that succeeds with given noun `huf`
191without consuming any text.
206 ++ easy :: always parse
212 [p=p.tub q=[~ u=[p=huf q=tub]]]
218 > ((easy %foo) [[1 1] "abc"])
219 [p=[p=1 q=1] q=[~ [p=%foo q=[p=[p=1 q=1] q="abc"]]]]
220 > ((easy %foo) [[1 1] "bc"])
221 [p=[p=1 q=1] q=[~ [p=%foo q=[p=[p=1 q=1] q="bc"]]]]
222 > ((easy 'a') [[1 1] "bc"])
223 [p=[p=1 q=1] q=[~ [p='a' q=[p=[p=1 q=1] q="bc"]]]]
232Parser modifier. Accepts a `++rule` `sef`, and produces a parser that succeeds only
233when the of `tub` is fully consumed using `sef`.
248 ++ full :: parse to end
252 ?~(q.vex vex ?:(=(~ q.q.u.q.vex) vex [p=p.vex q=~]))
258 > ((full (just 'a')) [[1 1] "ab"])
260 > ((full (jest 'ab')) [[1 1] "ab"])
261 [p=[p=1 q=3] q=[~ u=[p='ab' q=[p=[p=1 q=3] q=""]]]]
262 > ((full ;~(plug (just 'a') (just 'b'))) [[1 1] "ab"])
263 [p=[p=1 q=3] q=[~ u=[p=[~~a ~~b] q=[p=[p=1 q=3] q=""]]]]
272Parser modifier: prepend text to `++tape` before applying parser.
289 ++ funk :: add to tape first
290 |* {pre/tape sef/rule}
292 (sef p.tub (weld pre q.tub))
297 > ((funk "abc prefix-" (jest 'abc')) [[1 1] "to be parsed"])
298 [p=[p=1 q=4] q=[~ [p='abc' q=[p=[p=1 q=4] q=" prefix-to be parsed"]]]]
299 > ((funk "parse" (just 'a')) [[1 4] " me"])
309Parser modifier. Similar to `++cook` in that it produces a parser that takes a
310(successful) result of `sef` and slams it through `hez`. `hez` accepts a
311`++pint` `a` and a noun `b`, which is what the parser parsed.
328 ++ here :: place-based apply
330 |* {hez/_|=({a/pint b/*} [a b]) sef/rule}
336 [p=p.vex q=[~ u=[p=(hez [p.tub p.q.u.q.vex] p.u.q.vex) q=q.u.q.vex]]]
342 > (scan "abc" (star alf))
344 > (scan "abc" (here |*(^ +<) (star alf)))
345 [[[p=1 q=1] p=1 q=4] "abc"]
346 > (scan "abc" (star (here |*(^ +<) alf)))
347 ~[[[[p=1 q=1] p=1 q=2] ~~a] [[[p=1 q=2] p=1 q=3] ~~b] [[[p=1 q=3] p=1 q=4] ~~c]]
356Parser modifier: surround with pair of `++rule`s, the output of which is
362`fel` is a pair of `++rule`s.
375 |* {fel/{rule rule} hof/rule}
379 ;~(pfix -.fel ;~(sfix hof +.fel))
385 > (scan "-40-" (ifix [hep hep] dem))
387 > (scan "4my4" (ifix [dit dit] (star alf)))
397Match and consume a cord.
412 ++ jest :: match a cord
418 [p=p.tub q=[~ u=[p=fad q=tub]]]
419 ?: |(?=($~ q.tub) !=((end 3 1 daf) i.q.tub))
421 $(p.tub (lust i.q.tub p.tub), q.tub t.q.tub, daf (rsh 3 1 daf))
427 > ((jest 'abc') [[1 1] "abc"])
428 [p=[p=1 q=4] q=[~ [p='abc' q=[p=[p=1 q=4] q=""]]]]
429 > (scan "abc" (jest 'abc'))
431 > (scan "abc" (jest 'acb'))
435 > ((jest 'john doe') [[1 1] "john smith"])
437 > ((jest 'john doe') [[1 1] "john doe"])
438 [p=[p=1 q=9] q=[~ [p='john doe' q=[p=[p=1 q=9] q=""]]]]
447Match and consume a single character.
462 ++ just :: XX redundant, jest
463 ~/ %just :: match a char
479 > ((just 'a') [[1 1] "abc"])
480 [p=[p=1 q=2] q=[~ [p=~~a q=[p=[p=1 q=2] q="bc"]]]]
481 > (scan "abc" (just 'a'))
485 > (scan "a" (just 'a'))
487 > (scan "%" (just '%'))
497Used for recursive parsers, which would otherwise be infinite when
505`sef` is a gate that accepts a `++rule`
516 |* {gar/* sef/_|.(*rule)}
525 > |-(;~(plug prn ;~(pose $ (easy ~))))
528 > |-(;~(plug prn ;~(pose (knee *tape |.(^$)) (easy ~))))
530 [ c=c=tub=[p=[p=@ud q=@ud] q=""]
533 [ c=tub=[p=[p=@ud q=@ud] q=""]
534 b=<1.tnv [tub=[p=[p=@ud q=@ud] q=""] <1.ktu [daf=@tD <414.fvk 101.jzo 1.ypj %164>]>]>
535 a=<1.fvg [tub=[p=[p=@ud q=@ud] q=""] <1.khu [[les=@ mos=@] <414.fvk 101.jzo 1.ypj %164>]>]>
536 v=<414.fvk 101.jzo 1.ypj %164>
540 ... 450 lines omitted ...
543 > (scan "abcd" |-(;~(plug prn ;~(pose (knee *tape |.(^$)) (easy ~)))))
553Parser generator. Matches the next character if it is in a list of
559`bud` is a list of `++char`
569 ++ mask :: match char in set
577 ?. (lien bud |=(a/char =(i.q.tub a)))
585 > (scan "a" (mask "cba"))
587 > ((mask "abc") [[1 1] "abc"])
588 [p=[p=1 q=2] q=[~ [p=~~a q=[p=[p=1 q=2] q="bc"]]]]
589 > ((mask "abc") [[1 1] "bbc"])
590 [p=[p=1 q=2] q=[~ [p=~~b q=[p=[p=1 q=2] q="bc"]]]]
591 > ((mask "abc") [[1 1] "dbc"])
599Parse list with delimiter
601Parser modifier: Parse a list of matches using a delimiter `++rule`.
619 |* {bus/rule fel/rule}
620 ;~(pose (most bus fel) (easy ~))
626 > (scan "" (more ace dem))
628 > (scan "40 20" (more ace dem))
630 > (scan "40 20 60 1 5" (more ace dem))
631 [q=40 ~[q=20 q=60 q=1 q=5]]
638Parse list of at least one match
640Parser modifier: parse a `++list` of at least one match using a delimiter `++rule`.
658 |* {bus/rule fel/rule}
659 ;~(plug fel (star ;~(pfix bus fel)))
665 > (scan "40 20" (most ace dem))
667 > (scan "40 20 60 1 5" (most ace dem))
668 [q=40 ~[q=20 q=60 q=1 q=5]]
669 > (scan "" (most ace dem))
680Consume any character, producing it as a result.
695 ++ next :: consume a char
700 =+ zac=(lust i.q.tub p.tub)
701 [zac [~ i.q.tub [zac t.q.tub]]]
707 > (next [[1 1] "ebc"])
708 [p=[p=1 q=2] q=[~ [p=~~e q=[p=[p=1 q=2] q="bc"]]]]
709 > (next [[1 1] "john jumps jones"])
710 [p=[p=1 q=2] q=[~ [p=~~j q=[p=[p=1 q=2] q="ohn jumps jones"]]]]
718List of at least one match.
720Parser modifier: parse `++list` of at least one match.
735 ++ plus |*(fel/rule ;~(plug fel (star fel)))
741 > (scan ">>>>" (cook lent (plus gar)))
743 > (scan "- - " (plus ;~(pose ace hep)))
745 > `tape`(scan "- - " (plus ;~(pose ace hep)))
747 > `(pole ,@t)`(scan "- - " (plus ;~(pose ace hep)))
748 ['-' [' ' [' ' ['-' [' ' ~]]]]]
757Conditional `++cook`. Slams the result through a gate that produces
758a unit; if that unit is empty, fail.
772 ++ sear :: conditional cook
773 |* {pyq/$-(* (unit)) sef/rule}
778 =+ gey=(pyq p.u.q.vex)
781 [p=p.vex q=[~ u=[p=u.gey q=q.u.q.vex]]]
788 > ((sear |=(a/* ?@(a (some a) ~)) (just `a`)) [[1 1] "abc"])
789 [p=[p=1 q=2] q=[~ u=[p=97 q=[p=[p=1 q=2] q="bc"]]]]
790 > ((sear |=(* ~) (just 'a')) [[1 1] "abc"])
800Match characters (`++char`) within a range.
817 ++ shim :: match char in range
825 ?. ?&((gte i.q.tub les) (lte i.q.tub mos))
833 > ((shim 'a' 'z') [[1 1] "abc"])
834 [p=[p=1 q=2] q=[~ [p=~~a q=[p=[p=1 q=2] q="bc"]]]]
835 > ((shim 'a' 'Z') [[1 1] "abc"])
837 > ((shim 'a' 'Z') [[1 1] "Abc"])
838 [p=[p=1 q=2] q=[~ [p=~~~41. q=[p=[p=1 q=2] q="bc"]]]]
845Use gate to parse delimited list
847Parser modifier: By composing with a gate, parse a delimited `++list` of
866 |* raq/_|*({a/* b/*} [a b])
867 |* {bus/rule fel/rule}
868 ;~((comp raq) fel (stir +<+.raq raq ;~(pfix bus fel)))
875 > (scan "20+5+110" ((slug add) lus dem))
877 > `@t`(scan "a b c" ((slug |=(a/[@ @t] (cat 3 a))) ace alp))
887Add a label to an edge parsed by a rule.
904 ++ stag :: add a label
912 [p=p.vex q=[~ u=[p=[gob p.u.q.vex] q=q.u.q.vex]]]
918 > ((stag %foo (just 'a')) [[1 1] "abc"])
919 [p=[p=1 q=2] q=[~ u=[p=[%foo ~~a] q=[p=[p=1 q=2] q="bc"]]]]
920 > ((stag "xyz" (jest 'abc')) [[1 1] "abc"])
921 [p=[p=1 q=4] q=[~ u=[p=["xyz" 'abc'] q=[p=[p=1 q=4] q=""]]]]
922 > ((stag 10.000 (shim 0 100)) [[1 1] "abc"])
923 [p=[p=1 q=2] q=[~ u=[p=[10.000 ~~a] q=[p=[p=1 q=2] q="bc"]]]]
932Parser modifier: parse `++list` of matches.
942 ++ star :: 0 or more times
944 (stir `(list _(wonk *fel))`~ |*({a/* b/*} [a b]) fel)
949 > (scan "aaaaa" (just 'a'))
953 > (scan "aaaaa" (star (just 'a')))
955 > (scan "abcdef" (star (just 'a')))
959 > (scan "abcabc" (star (jest 'abc')))
961 > (scan "john smith" (star (shim 0 200)))
971Add faces `[p q]` to range-parser pairs in a list.
976`leh` is a list of range-parsers.
987 |* leh/(list {?(@ {@ @}) rule})
991 [i=[p=-.i.leh q=+.i.leh] t=$(leh t.leh)]
997 > (stet (limo [[5 (just 'a')] [1 (jest 'abc')] [[1 1] (shim 0 200)]
998 [[1 10] (cold %foo (just 'a'))]~]))
1000 [p=5 q=<1.lrk [tub=[p=[p=@ud q=@ud] q=""] <1.nqy [daf=@tD <394.imz 97.kdz 1.xlc %164>]>]>]
1001 [p=1 q=<1.lrk [tub=[p=[p=@ud q=@ud] q=""] <1.nqy [daf=@tD <394.imz 97.kdz 1.xlc %164>]>]>]
1002 [p=[1 1] q=<1.lrk [tub=[p=[p=@ud q=@ud] q=""] <1.nqy [daf=@tD <394.imz 97.kdz 1.xlc %164>]>]>]
1003 [p=[1 10] q=<1.lrk [tub=[p=[p=@ud q=@ud] q=""] <1.nqy [daf=@tD <394.imz 97.kdz 1.xlc %164>]>]>]
1005 > [[[1 1] (just 'a')] [[2 1] (shim 0 200)] ~]
1006 [ [[1 1] <1.tnv [tub=[p=[p=@ud q=@ud] q=""] <1.ktu [daf=@tD <414.fvk 101.jzo 1.ypj %164>]>]>]
1007 [[2 1] <1.fvg [tub=[p=[p=@ud q=@ud] q=""] <1.khu [[les=@ mos=@] <414.fvk 101.jzo 1.ypj %164>]>]>]
1010 > (stet (limo [[[1 1] (just 'a')] [[2 1] (shim 0 200)] ~]))
1012 [p=[1 1] q=<1.lrk [tub=[p=[p=@ud q=@ud] q=""] <1.nqy [daf=@tD <394.imz 97.kdz 1.xlc %164>]>]>]
1013 [p=[2 1] q=<1.lrk [tub=[p=[p=@ud q=@ud] q=""] <1.nqy [daf=@tD <394.imz 97.kdz 1.xlc %164>]>]>]
1023 ++ stew :: switch by first char
1025 |* leh/(list {p/?(@ {@ @}) q/rule}) :: char+range keys
1026 =+ ^= wor :: range complete lth
1027 |= {ort/?(@ {@ @}) wan/?(@ {@ @})}
1029 ?@(wan (lth ort wan) (lth ort -.wan))
1030 ?@(wan (lth +.ort wan) (lth +.ort -.wan))
1031 =+ ^= hel :: build parser map
1032 =+ hel=`(tree _?>(?=(^ leh) i.leh))`~
1040 ?: (wor p.i.leh p.n.yal)
1043 ?: (vor p.n.yal p.n.nuc)
1045 [n.nuc l.nuc [n.yal r.nuc r.yal]]
1048 ?: (vor p.n.yal p.n.nuc)
1050 [n.nuc [n.yal l.yal l.nuc] r.nuc]
1060 ?&((gte i.q.tub -.p.n.hel) (lte i.q.tub +.p.n.hel))
1061 :: (q.n.hel [(lust i.q.tub p.tub) t.q.tub])
1063 ?: (wor i.q.tub p.n.hel)
1070Parser generator. From an associative `++list` of characters or character
1071ranges to `++rule`s, construct a `++map`, and parse `++tape`s only
1072with `++rules` associated with a range that the `++tape`'s first character falls in.
1081Parse with `++rule` as many times as possible, and fold over results with a
1089`raq` is a gate that takes two nouns and produces a cell.
1101 ++ stun :: parse several times
1102 |* {lig/{@ @} fel/rule}
1104 ^- (like (list _(wonk (fel))))
1113 -.lig ?:(=(0 -.lig) 0 (dec -.lig))
1114 +.lig ?:(=(0 +.lig) 0 (dec +.lig))
1119 [p.wag [~ [p.u.q.vex p.u.q.wag] q.u.q.wag]]
1125 > (scan "abc" (stir *@ add prn))
1137Parse bounded number of times.
1142`[les=@ mos=@]` is a cell of atoms indicating the bounds.
1154 ++ stun :: parse several times
1155 |* {lig/{@ @} fel/rule}
1157 ^- (like (list _(wonk (fel))))
1166 -.lig ?:(=(0 -.lig) 0 (dec -.lig))
1167 +.lig ?:(=(0 +.lig) 0 (dec +.lig))
1172 [p.wag [~ [p.u.q.vex p.u.q.wag] q.u.q.wag]]
1177 > ((stun [5 10] prn) [1 1] "aquickbrownfoxran")
1178 [p=[p=1 q=11] q=[~ [p="aquickbrow" q=[p=[p=1 q=11] q="nfoxran"]]]]
1179 > ((stun [5 10] prn) [1 1] "aquickbro")
1180 [p=[p=1 q=10] q=[~ [p="aquickbro" q=[p=[p=1 q=10] q=""]]]]
1181 > ((stun [5 10] prn) [1 1] "aqui")
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list