A Fast Parsing Scheme for Hand-Printed Mathematical Expressions
A set of one-line text-book-style mathematical expressions is defined by a context free grammar. This grammar generates strings which describe the expressions in terms of mathematical symbols and some simple positional operators, such as vertical concatenation. The grammar rules are processed to abs...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6083 |
| _version_ | 1826199803900461056 |
|---|---|
| author | Martin, William A. |
| author_facet | Martin, William A. |
| author_sort | Martin, William A. |
| collection | MIT |
| description | A set of one-line text-book-style mathematical expressions is defined by a context free grammar. This grammar generates strings which describe the expressions in terms of mathematical symbols and some simple positional operators, such as vertical concatenation. The grammar rules are processed to abstract information used to drive the parsing scheme. This has been called syntax-controlled as opposed to syntax-directed analysis. The parsing scheme consists of two operations. First, the X-Y plane is searched in such a way that the mathematical characters are picked up in a unique order. Then, the resulting character string is parsed using a precedence algorithm with certain modifications for special cases. The search of the X-Y plane is directed by the particular characters encountered. |
| first_indexed | 2024-09-23T11:26:20Z |
| id | mit-1721.1/6083 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:26:20Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/60832019-04-12T08:29:00Z A Fast Parsing Scheme for Hand-Printed Mathematical Expressions Martin, William A. A set of one-line text-book-style mathematical expressions is defined by a context free grammar. This grammar generates strings which describe the expressions in terms of mathematical symbols and some simple positional operators, such as vertical concatenation. The grammar rules are processed to abstract information used to drive the parsing scheme. This has been called syntax-controlled as opposed to syntax-directed analysis. The parsing scheme consists of two operations. First, the X-Y plane is searched in such a way that the mathematical characters are picked up in a unique order. Then, the resulting character string is parsed using a precedence algorithm with certain modifications for special cases. The search of the X-Y plane is directed by the particular characters encountered. 2004-10-04T14:38:46Z 2004-10-04T14:38:46Z 1967-10-19 AIM-145 http://hdl.handle.net/1721.1/6083 en_US AIM-145 28 p. 1255090 bytes 985990 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Martin, William A. A Fast Parsing Scheme for Hand-Printed Mathematical Expressions |
| title | A Fast Parsing Scheme for Hand-Printed Mathematical Expressions |
| title_full | A Fast Parsing Scheme for Hand-Printed Mathematical Expressions |
| title_fullStr | A Fast Parsing Scheme for Hand-Printed Mathematical Expressions |
| title_full_unstemmed | A Fast Parsing Scheme for Hand-Printed Mathematical Expressions |
| title_short | A Fast Parsing Scheme for Hand-Printed Mathematical Expressions |
| title_sort | fast parsing scheme for hand printed mathematical expressions |
| url | http://hdl.handle.net/1721.1/6083 |
| work_keys_str_mv | AT martinwilliama afastparsingschemeforhandprintedmathematicalexpressions AT martinwilliama fastparsingschemeforhandprintedmathematicalexpressions |