Description Usage Arguments Value See Also Examples
thentree keeps the full tree representation of the results of parsing.
Otherwise, it is identical to then.
1 | thentree(p1, p2)
|
p1 |
the first parser |
p2 |
the second parser |
recognises anything that p1 and p2 would if placed in
succession.
1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.