[Next] [Up] [Previous]

**Next:** Lexical analysis and **Up:** Recognizing high-level document
**Previous:** Refining the quasi-prefix

This section describes
the techniques used to extract high-level models from the
La)TeX source. A recursive descent parsing algorithm is used to
construct the tree structure for document content conforming to
the model described in s:high-level-models. This algorithm is
modified to construct the quasi-prefix form. These refinements
enable our recognizer to correctly handle ambiguous
mathematical notation, as in the expression
[tex2html_wrap5368]. We use a modified version of the
conventional operator-precedence approach for constructing the
quasi-prefix form. With the refinements and heuristics outlined
in this section, our algorithm successfully recognizes written
mathematical notation from a wide variety of sources.

TV Raman

Thu Mar 9 20:10:41 EST 1995