A Fast Parsing Scheme for Hand-Printed Mathematical Expressions

dc.creator	Martin, William A.
dc.date	2004-10-04T14:38:46Z
dc.date	2004-10-04T14:38:46Z
dc.date	1967-10-19
dc.date.accessioned	2013-10-09T02:42:48Z
dc.date.available	2013-10-09T02:42:48Z
dc.date.issued	2013-10-09
dc.identifier	AIM-145
dc.identifier	http://hdl.handle.net/1721.1/6083
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.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.
dc.format	28 p.
dc.format	1255090 bytes
dc.format	985990 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-145
dc.title	A Fast Parsing Scheme for Hand-Printed Mathematical Expressions

Files in this item

Files	Size	Format	View
There are no files associated with this item.