A new parsing scheme for plex grammars

Abstract Plex structures specified by plex grammars are sets of symbols which interconnect in multidirection. We propose a new parsing scheme for plex grammars, which consists of two phases for symbols and their interconnections respectively in an input plex structure. The parsing of plex structures is simplified by our parsing scheme, because we are required to parse only a set of symbols instead of a plex structure. Algorithms for the first phase are primarily discussed in this paper. Earley's algorithm is extended to recognize a set of symbols. It is anticipated that the two-phase scheme of parsing may suggest a method for the parsing of other high-dimensional pattern grammars.

[1]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[2]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[3]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[4]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[5]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[6]  Mariusz Flasiński.  Parsing of edNLC-graph grammars for scene analysis , 1988, Pattern Recognit..

[7]  Wei-Chung Lin,et al.  A Syntactic Approach to Three-Dimensional Object Recognition , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Bharat K. Bhargava,et al.  Tree Systems for Syntactic Pattern Recognition , 1973, IEEE Transactions on Computers.

[9]  King-Sun Fu,et al.  Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  T. Kawashima,et al.  Attribute expansive graph grammar for pattern description and its problem-reduction based processing , 1988 .

[11]  Wei-Chung Lin,et al.  A Syntactic Approach to 3-D Object Representation , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.