Re^3: Reversible parsing (with Parse::RecDescent?)

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.

"What should it profit a man, if he should win a flame war, yet lose his cool?"

Comment on Re^3: Reversible parsing (with Parse::RecDescent?)

Replies are listed 'Best First'.
Re^4: Reversible parsing (with Parse::RecDescent?) by blokhead (Monsignor) on Mar 15, 2008 at 03:00 UTC
The OP asks to go from string to parse tree back to the original string, not parse tree to string to original parse tree. blokhead	[reply]