Анастасия Рагозина


Окончила математико-механический факультет СПбГУ в 2014 году. В настоящее время работает над магистерской диссертацией.


  • Фреймворк для разработки генераторов синтаксических анализаторов, компиляторов компиляторов и прочего grammarware для .NET.
    Руководитель проекта: Семён Григорьев


  • Semyon Grigorev, Anastasiya Ragozina

    There are several solutions for CFPQ, but how to provide structural representation of query result which is practical for answer processing and debugging is still an open problem. In this paper we propose a graph parsing technique which allows one to build such representation with respect to given grammar in polynomial time and space for arbitrary context-free grammar and graph. Proposed algorithm is based on generalized LL parsing algorithm, while previous solutions are based mostly on CYK or Earley algorithms, which reduces time complexity in some cases.

    Proceedings of the 13th Central & Eastern European Software Engineering Conference in Russia (CEE-SECR '17), Декабрь 2017
  • Ragozina Anastasiya, Grigorev Semyon
    Systems and Means of Informatics, 2015