No. At least, for most grammars there are multiple variations of code that will end up as the same syntax tree / data structure. IOW if the original input is unambiguous, you should be able to reverse it into something equivalent but not necessarily character-for-character the same. If the input is ambiguous you'll have more problems.
You would still be able to do the direction that the OP wants, even in an ambiguous grammar. Say the OP uses a parser to convert string to parse tree. 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. Formally, the deparsing operation is always a left inverse of the (set of) parsing operation(s), but only a right inverse if the grammar is unambiguous.
Of course, the above discussion is all in the world of theoretical context-free languages, where the parse tree contains every production that was applied. In real life, we don't parse strings, we parse a stream of tokens, and anything lost in tokenization doesn't make it into the parse tree. We also flatten/simplify parse trees on the fly, resolve syntactic sugar, and do various other shortcuts.. not to mention non-context-free things that P::RD can do. Anyway, if your parse tree contains the important syntactic structure, as ikegami says, you can always deparse it back to obtain at least a syntactically equivalent string to the original.