基于带有多端口组件的语法图构建解析器

IF 0.2 Q4 MATHEMATICS, APPLIED

Prikladnaya Diskretnaya Matematika Pub Date : 2022-01-01 DOI:10.17223/20710410/55/8

Yuriy Ryazanov, S. V. Nazina

{"title":"基于带有多端口组件的语法图构建解析器","authors":"Yuriy Ryazanov, S. V. Nazina","doi":"10.17223/20710410/55/8","DOIUrl":null,"url":null,"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.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"1 1","pages":""},"PeriodicalIF":0.2000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Building parsers based on syntax diagrams with multiport components\",\"authors\":\"Yuriy Ryazanov, S. V. Nazina\",\"doi\":\"10.17223/20710410/55/8\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":42607,\"journal\":{\"name\":\"Prikladnaya Diskretnaya Matematika\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Prikladnaya Diskretnaya Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17223/20710410/55/8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Prikladnaya Diskretnaya Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17223/20710410/55/8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

解决了基于多端口组件(SD)的语法图构造解析器的问题。提出了一种基于GLL算法构造解析器的算法，使输入链解析林的表示更加紧凑。该算法使得基于任意结构的SD构建解析器成为可能，并且不需要进行初始SD转换。我们为SD引入了“推理树”和“解析林”的概念，并描述了解析器使用的数据结构，例如图结构堆栈、解析器描述符和解析林的紧凑表示。描述了基于SD的解析器构造算法，并给出了一个解析器构造实例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Building parsers based on syntax diagrams with multiport components

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Prikladnaya Diskretnaya Matematika MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

50.00%

发文量

期刊介绍： The scientific journal Prikladnaya Diskretnaya Matematika has been issued since 2008. It was registered by Federal Control Service in the Sphere of Communications and Mass Media (Registration Witness PI № FS 77-33762 in October 16th, in 2008). Prikladnaya Diskretnaya Matematika has been selected for coverage in Clarivate Analytics products and services. It is indexed and abstracted in SCOPUS and WoS Core Collection (Emerging Sources Citation Index). The journal is a quarterly. All the papers to be published in it are obligatorily verified by one or two specialists. The publication in the journal is free of charge and may be in Russian or in English. The topics of the journal are the following: 1.theoretical foundations of applied discrete mathematics – algebraic structures, discrete functions, combinatorial analysis, number theory, mathematical logic, information theory, systems of equations over finite fields and rings; 2.mathematical methods in cryptography – synthesis of cryptosystems, methods for cryptanalysis, pseudorandom generators, appreciation of cryptosystem security, cryptographic protocols, mathematical methods in quantum cryptography; 3.mathematical methods in steganography – synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security; 4.mathematical foundations of computer security – mathematical models for computer system security, mathematical methods for the analysis of the computer system security, mathematical methods for the synthesis of protected computer systems;[...]