2022Unpublished venueOpen access

Algorithm of parsing context-free grammars

Grigoriy V. Bokov, Gleb Vyacheslavovich Kalachev

Open full text 0 citations

Abstract

he paper proposes an algorithm that parses dynamically expandable context-free grammars. The proposed algorithm is implemented on C++ language and is part of the PyLExt library, which allows you to add syntactic extensions to the Python language.

Open-access reader

About this research paper

What this paper is about

he paper proposes an algorithm that parses dynamically expandable context-free grammars. The proposed algorithm is implemented on C++ language and is part of the PyLExt library, which allows you to add syntactic extensions to the Python language.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

he paper proposes an algorithm that parses dynamically expandable context-free grammars. The proposed algorithm is implemented on C++ language and is part of the PyLExt library, which allows you to add syntactic extensions to the Python language.

Key concepts: Computer science, Parsing, Extended Affix Grammar, L-attributed grammar, Programming language, Python (programming language), Rule-based machine translation, Context-free grammar

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithm of parsing context-free grammars — Research Paper | ScholarLens