YaccConstructor

Project supervisor: Semyon Grigorev
Status: Active

YaccConstructor is a modular tool for parser construction and grammars processing. It is also a framework for research and development of parser generators, compilers compilers and other grammarware for .NET. YaccConstructor is mostly implemented in F#.

Participants

Publications

  • Semyon Grigorev and Polina Lunina

    We propose a way to combine formal grammars and artificial neural networks for biological sequences processing. Formal grammars encode the secondary structure of the sequence and neural networks deal with mutations and noise. In contrast to the classical way, when probabilistic grammars are used for secondary structure modeling, we propose to use arbitrary (not probabilistic) grammars which simplifies grammar creation. Instead of modeling the structure of the whole sequence, we create a grammar which only describes features of the secondary structure. Then we use matrix-based parsing to extract features: the fact that some substring can be derived from some nonterminal is a feature. After that, we use a dense neural network to process features.

    Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies - BIOINFORMATICS,
  • Ekaterina Verbitskaia, Ilya Kirillov, Ilya Nozkin, Semyon Grigorev

    Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general-purpose programming language as well as static checking of errors in queries may greatly simplify the development of applications using CFPQs. LINQ and ORM can be used for the integration, but they have issues with flexibility: query decomposition and reusing of subqueries are a challenge. Adaptation of parser combinators technique for paths querying may solve these problems. Conventional parser combinators process linear input, and only the Trails library is known to apply this technique for path querying. We demonstrate that it is possible to create general parser combinators for CFPQ which support arbitrary context-free grammars and arbitrary input graphs. We implement a library of such parser combinators and show that it is applicable for realistic tasks.

    Proceedings of the 9th ACM SIGPLAN International Symposium on Scala,
  • Rustam Azimov, Semyon Grigorev
    GRADES-NDA '18 Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA),
  • Rustam Azimov, Semyon Grigorev
    arXiv,
  • Semyon Grigorev, Anastasiya Ragozina
    arXiv,
  • Marina Polubelova, Sergey Bozhko, Semyon Grigorev
    Proceedings of the Institute for System Programming,
  • Ekaterina Verbitskaia , Semyon Grigorev, Dmitry Avdyukhin
    Perspectives of System Informatics,
  • Marina Polubelova, Semyon Grigorev
    Systems and Means of Informatics,
  • Marat Khabibullin, Andrei Ivanov, Semyon Grigorev
    Proceedings of the 11th Central & Eastern European Software Engineering Conference in Russia,
  • Ragozina Anastasiya, Grigorev Semyon
    Systems and Means of Informatics,
  • Ekaterina Verbitskaia, Semyon Grigorev and Dmitry Avdyukhin
    Proceedings of 10th International Andrei Ershov Memorial Conference on Perspectives of System Informatics,
  • Semen Grigorev, Ekaterina Verbitskaia, Andrei Ivanov, Marina Polubelova, and Ekaterina Mavchun
    Proceedings of the 10th Central and Eastern European Software Engineering Conference in Russia 2014,
  • Semen Grigorev and Iakov Kirilenko
    Proceedings of the 9th Central & Eastern European Software Engineering Conference in Russia,

Resources