This article is cited in 1 paper

Mathematical Backgrounds of Informatics and Programming

Building parsers based on syntax diagrams with multiport components

Yu. D. Ryazanov, S. V. Nazina

Belgorod State Technological University named after V. G. Shukhov, Belgorod, Russia

Abstract: The problem of constructing parsers from syntax diagrams with multiport components (SD) is solved. An algorithm for constructing a parser based on the GLL algorithm is proposed, which results in the compact representation of the input chain parse forest. The proposed algorithm makes it possible to build parsers based on the SD of an arbitrary structure and does not require preliminary SD transformations. We introduce the concepts of “inference tree” and “parsing forest” for SD and describe the data structures used by the parser, such as a graph-structured stack, a parser descriptor, and a compact representation of the parsing forest. The algorithm for constructing parsers based on SD is described and an example of parser constructing is given.

Keywords: parsing, syntax diagrams with multiport components, parse forest.

UDC: 004.4'413

DOI: 10.17223/20710410/55/8

Bibliographic databases:

•