Theory, examples of reversible parsers?

Question

Does anyone out there know about examples and the theory behind parsers that will take (maybe) an abstract syntax tree and produce code, instead of vice-versa. Mathematicall

Answer 1

There are theory, working implementations and examples of reversible parsing in Haskell. The library is by Paweł Nowak. Please refer to https://hackage.haskell.org/package/syntax as your starting point. You can find the examples at following URLs.

• https://hackage.haskell.org/package/syntax-example
• https://hackage.haskell.org/package/syntax-example-json