A production is a mapping of a nonterminal name A
into an parsing expression e
.
A = e
'abc'
- match the exactly same string 'abc'
.
- match any single byte characters[A-Z]
- match characters ranging from 'A'
to 'Z'
[Aa]
- match either 'A'
or 'a'
"string"
e1 e2
- sequencee2 / e2
- choicee?
- optione*
- repetitione+
- one more repetition (e e*
)&e
- and lookahead predicate!e
- not lookahead predicate{e}
- creating a new node with capturing a substring that is matched with e
.@e
- linking a child node that is constructed with e
to the left node{@ e}
#Tag
- tagging #Tag
to the left nodestr
- replacing a captured string of the left node with the specified string str
(TBA)
Copyright 2015 - 2016 Konoha Software Foundation | About this site