<s>
In	O
computing	O
,	O
an	O
unparser	B-Application
is	O
a	O
system	O
that	O
constructs	O
a	O
set	O
of	O
characters	O
or	O
image	O
components	O
from	O
a	O
given	O
parse	B-Language
tree	O
.	O
</s>
<s>
An	O
unparser	B-Application
is	O
in	O
effect	O
the	O
reverse	O
of	O
a	O
traditional	O
parser	B-Language
that	O
takes	O
a	O
set	O
of	O
string	O
of	O
characters	O
and	O
produces	O
a	O
parse	B-Language
tree	O
.	O
</s>
<s>
Unparsing	B-Application
generally	O
involves	O
the	O
application	O
of	O
a	O
specific	O
set	O
of	O
rules	O
to	O
the	O
parse	B-Language
tree	O
as	O
a	O
"	O
tree	B-Algorithm
walk	I-Algorithm
"	O
takes	O
place	O
.	O
</s>
<s>
Given	O
that	O
the	O
tree	O
may	O
involve	O
both	O
textual	O
and	O
graphic	O
elements	O
,	O
the	O
unparser	B-Application
may	O
have	O
two	O
separate	O
modules	O
,	O
each	O
of	O
which	O
handles	O
the	O
relevant	O
components	O
.	O
</s>
<s>
In	O
such	O
cases	O
the	O
"	O
master	O
unparser	B-Application
"	O
looks	O
up	O
the	O
"	O
master	O
unparse	O
table	O
"	O
to	O
determine	O
if	O
a	O
given	O
nested	O
structure	O
should	O
be	O
handled	O
by	O
one	O
module	O
,	O
or	O
the	O
other	O
.	O
</s>
