There may be multiple parse trees for that input, but the parser will find one. That parse tree is unambiguous and refers to just one string, so you will be able to go back.But if the grammar is ambiguous you may not get the result you expect by parsing the result of "reverse parse" again.
In reply to Re^3: Reversible parsing (with Parse::RecDescent?)
by Joost
in thread Reversible parsing (with Parse::RecDescent?)
by goibhniu
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |