pegjva lujvo

x1 is a rule that can be used in a Parsing Expression Grammar (PEG)

x1's first argument is the input text, its second argument is the parser's output, and its third one is the remainder of the text that the parser will process when done with this rule. Related: pegyuenzi, peglfi, pegrsto, pegrpoi, pegnpe, pegnaka, pegrcu'a, pegrke'u, pegrsu'o, pegrsu'e

In notes:

pegyuenzi
x1 is a text matching PEG rule x3, resulting in output x2
peglfi
x1 is a PEG rule that consumes the same input as x3, but produces the output of x3 mapped with function x2
pegnaka
x1 is a PEG negative lookahead, matching when rule x2 does not match
pegnpe
x1 is a PEG positive lookahead matching rule x2
pegrcu'a
x1 is a PEG ordered choice rule, matching and returning the result of the leftmost possible rule in sequence x2
pegrke'u
x1 is a PEG rule matching at least zero repetitions of rule x2 and returning a sequence of any match results
pegrpoi
x1 is a PEG rule matching what sequence of rules x2 matches and producing a sequence of the outputs of those rules
pegrsto
x1 is a PEG rule whose input and output is the constant x2
pegrsu'e
x1 is a PEG rule matching at most one repetition of rule x2 and returning a sequence of any match results
pegrsu'o
x1 is a PEG rule matching at least one repetition of rule x2 and returning a sequence of the match results