|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
1. |
A. V. Goloveshkin, S. S. Mikhalkovich, “Robust algorithmic binding to arbitrary fragment of program code”, Program Systems: Theory and Applications, 13:1 (2022), 3–33 ; Program Systems: Theory and Applications, 13:1 (2022), 35–62 |
|
2019 |
2. |
A. V. Goloveshkin, “Tolerant parsing using modified LR(1) and LL(1) algorithms with embedded “Any” symbol”, Proceedings of ISP RAS, 31:3 (2019), 7–28 |
3
|
|
2018 |
3. |
A. V. Goloveshkin, S. S. Mikhalkovich, “Tolerant parsing with a special kind of «Any» symbol: the algorithm and practical application”, Proceedings of ISP RAS, 30:4 (2018), 7–28 |
4
|
|
Organisations |
|
|