Unparser

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

A parse tree, which generates "John hit the ball" when it is unparsed.

In computing, an unparser is a system that constructs a set of characters or image components from a given parse tree.^[1]^[2]

An unparser is in effect the reverse of a traditional parser that takes a set of string of characters and produces a parse tree. Unparsing generally involves the application of a specific set of rules to the parse tree as a "tree walk" takes place.^[1]

Given that the tree may involve both textual and graphic elements, the unparser may have two separate modules, each of which handles the relevant components.^[2] In such cases the "master unparser" looks up the "master unparse table" to determine if a given nested structure should be handled by one module, or the other.^[2]

References

^ ^a ^b Software Science and Engineering edited by Ikuo Nakata 1991 ISBN 981020776X page 168
^ ^a ^b ^c Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools by H. Ehrig, G. Engels 1999 ISBN 9810240201 pages 231-232

This computing article is a stub. You can help Wikipedia by expanding it.

[Ikuo-1] Software Science and Engineering edited by Ikuo Nakata 1991 ISBN 981020776X page 168

[Ehrig-2] Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools by H. Ehrig, G. Engels 1999 ISBN 9810240201 pages 231-232

[1]

[2]

See also

References