Investigation of Parsing Expression Grammars

Student: Chudinov Nikita

Supervisor: Alexander A Rubtsov

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 8

Year of Graduation: 2019

Parsing Expression Grammars are a fairly new method of describing languages, similar to formal grammars. They are a very interesing instrument as PEG have more expressive power than regular languages and even deterministic context-free languages, and, at the same time, solve some problems that emerge with traditional tools. As a result of that, PEG are already quite widespread among different programming languages. Despite all interest, there exists little research on that topic. In particular, all proposed computational models for PEG are complicated and dissimilar to that of other formal grammars. First part of this work is dedicated to overview of PEG and research around them. In the main part I propose a new computational model equivalent to PEG and prove their equivalence.

Full text (added May 15, 2019)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses