Formal parsing systems

Abstract

Automatic syntactic analysis has recently become important for both natural language data processing and syntax-directed compilers. A formal parsing system <italic>G</italic> = (<italic>V, μ, T, R</italic>) consists of two finite disjoint vocabularies, <italic>V</italic> and <italic>T</italic>, a many-many map, <italic>μ</italic>, from <italic>V</italic… (More)
DOI: 10.1145/355586.364826

Topics

5 Figures and Tables

Slides referencing similar topics