Using grammar and program transformation a compact, efficient and easily used method of
parsing infix expressions is derived. The resulting algorithm does not require the
construction of precedence matrices, neither does it normally require transformation of the …