Efficient Ambiguous Parsing of Mathematical Formulae
- Cite this paper as:
- Coen C.S., Zacchiroli S. (2004) Efficient Ambiguous Parsing of Mathematical Formulae. In: Asperti A., Bancerek G., Trybulec A. (eds) Mathematical Knowledge Management. MKM 2004. Lecture Notes in Computer Science, vol 3119. Springer, Berlin, Heidelberg
Mathematical notation has the characteristic of being ambiguous: operators can be overloaded and information that can be deduced is often omitted. Mathematicians are used to this ambiguity and can easily disambiguate a formula making use of the context and of their ability to find the right interpretation.
Software applications that have to deal with formulae usually avoid these issues by fixing an unambiguous input notation. This solution is annoying for mathematicians because of the resulting tricky syntaxes and becomes a show stopper to the simultaneous adoption of tools characterized by different input languages.
In this paper we present an efficient algorithm suitable for ambiguous parsing of mathematical formulae. The only requirement of the algorithm is the existence of a “validity” predicate over abstract syntax trees of incomplete formulae with placeholders. This requirement can be easily fulfilled in the applicative area of interactive proof assistants, and in several other areas of Mathematical Knowledge Management.
Unable to display preview. Download preview PDF.