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


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


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


  • Semyon Grigorev, Anastasiya Ragozina

    Graph data model and graph databases are very popular in various areas such as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars. The query in this approach is written as grammar, and paths querying is graph parsing with respect to given grammar. There are several solutions to it, 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.

    arXiv, Декабрь 2016
  • Ragozina Anastasiya, Grigorev Semyon
    Systems and Means of Informatics, 2015