Abstract
In the present article, we consider the question on modeling Backus–Naur forms (BNF-systems) and generating grammars in GNF-systems. GNF-systems serve as the base for construction of monotone operators whose least fixed points are polynomially computable. We obtain our results by construction of GNF-systems and application of a generalized polynomial analog of Gandy’s fixed point theorem. This allows us to answer some questions on existence of a polynomially computable representation for the set of derivations in generating grammars. Moreover, we show that, for each GNF-system modeling a BNF-system and every nonterminal symbol in the BNF-system, the set of preimages in the GNF-system of representations of this symbol is polynomially computable. This result allows us to encode all definable constructions of the BNF-system, including the syntax of programs in high-level programming languages, so that they become recognizable in polynomial time.
Similar content being viewed by others
REFERENCES
J. W. Backus, “The syntax and semantics of the proposed international algebraic language of the Zurich ACM–GAMM conference,” Proc. Internat. Conf. Inform. Process., 125 (UNESCO, Paris, 1960).
Yu. L. Ershov, Definability and Computability (Nauchnaya Kniga, Novosibisrk, 1996) [Definability and Computability (Consultants Bureau, New York, 1996)].
Yu. L. Ershov, S. S. Goncharov, and D. I. Sviridenko, “Semantic programming,” Inform. Process. Proc. IFIP \(10 \)th World Computer Congress, 1113 (North Holland, Amsterdam, 1986).
S. S. Goncharov, “Conditional terms in semantic programming,” Sib. Mathem. Zh. 58, 1026 (2017) [Siberian Math. J. 58, 794 (2017)].
S. Goncharov and A. Nechesov, “Polynomial analogue of Gandy’s fixed point theorem,” MDPI Math. 9, Art. 2102 (2021).
S. Goncharov and A. Nechesov, “Solution of the problem \(P = L \),” MDPI Math. 10, Art. 113 (2022).
S. S. Goncharov, S. S. Ospichev, D. K. Ponomaryov, and D. I. Sviridenko, “The expressiveness of looping terms in the semantic programming,” Siberian Electron. Math. Rep. 17, 380 (2020).
S. S. Goncharov and D. I. Sviridenko, “\(\Sigma \)-programming,” Vychisl. Sist. 107, 3 (1985) [Transl. Amer. Math. Soc., Ser. II 142, 101 (1989)].
S. S. Goncharov and D. I. Sviridenko, “Recursive terms in semantic programming,” Sib. Matem. Zh. 59, 1279 (2018) [Siberian Math. J. 59, 1014 (2018)].
S. S. Goncharov and D. I. Sviridenko, “The logic language of polynomial computability,” Dokl. Ross. Akad. Nauk 485, 11 (2019) [Dokl. Math. 99, 121 (2019)].
S. S. Ospichev and D. K. Ponomaryov, “On the complexity of formulas in semantic programming,” Siberian Electron. Math. Rep. 15, 987 (2018).
Ya. G. Testelets, Introduction to General Syntax (RGGU Publ., Moscow, 2001) [in Russian].
Backus–Naur form (Wikipedia, https://en.wikipedia.org/wiki/Backus-Naur_form).
Funding
The study was carried out within the framework of the state contract of the Sobolev Institute of Mathematics, SB RAS (project no. FWNF-2022-0011).
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Nechesov, A.V. Some Questions on Polynomially Computable Representations for Generating Grammars and Backus–Naur Forms. Sib. Adv. Math. 32, 299–309 (2022). https://doi.org/10.1134/S1055134422040058
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1055134422040058