Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Mikhail Barash"'
Autor:
Mikhail Barash, Alexander Okhotin
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 94-108 (2014)
In a recent paper (M. Barash, A. Okhotin, "Defining contexts in context-free grammars", LATA 2012), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the substring being de
Externí odkaz:
https://doaj.org/article/22d6c62a0ba244b8838b78f57c9cda08
Publikováno v:
Journal of Computer Languages. 74:101175
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d1259ed158c81cb1143ba974da43f23
https://doi.org/10.1016/j.cola.2022.101175
https://doi.org/10.1016/j.cola.2022.101175
Autor:
Mikhail Barash
Publikováno v:
SLE
Language workbenches (LWBs) are tools to define software languages together with tailored Integrated Development Environments for them. A comprehensive review of language workbenches by Erdweg et al. (Comput. Lang. Syst. Struct. 44, 2015) presented a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d86915f54a1c0052326c8a83c6e6ac3
https://doi.org/10.1145/3486608.3486907
https://doi.org/10.1145/3486608.3486907
Autor:
Mikhail Barash, Vaclav Pech
Publikováno v:
Domain-Specific Languages in Practice ISBN: 9783030737573
In this chapter, we present our experience on teaching MPS to industry professionals and university students. JetBrains has run its commercial courses on MPS both online and on-site for 19 different customers coming from 12 countries over the past 5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c439d906b62040c0ff96e6eeb624a2f
https://doi.org/10.1007/978-3-030-73758-0_10
https://doi.org/10.1007/978-3-030-73758-0_10
Publikováno v:
GPCE
GUIs often contain structures that are incidental, not properly manipulatable through well-defined APIs. For example, modifying a list of items in a GUI's model may require extraneous bookkeeping operations in the view, such as adding and removing ev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14970bfbc63138646c07324359304565
https://doi.org/10.1145/3425898.3426956
https://doi.org/10.1145/3425898.3426956
Autor:
Mikhail Barash
Publikováno v:
SLE
Language workbenches---tools to define software languages together with their IDEs---are designed to simplify language engineering and implementation: they free language engineers from many meticulous tasks, but oftentimes have a very steep learning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c811455b92c958cf5b971f1d5560a2fd
https://doi.org/10.1145/3426425.3426945
https://doi.org/10.1145/3426425.3426945
Autor:
Mikhail Barash
Publikováno v:
MODELS Companion
While language workbenches---tools to define software languages together with their IDEs---are yet to become ubiquitous in industry, a noticeable amount of domain modeling is still done using word processors and spreadsheet calculators. We suggest an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::160aca4aa6e399d144a07e0faa270e71
https://doi.org/10.1145/3417990.3420051
https://doi.org/10.1145/3417990.3420051
Autor:
Mikhail Barash, Alexander Okhotin
Publikováno v:
Theoretical Computer Science. 719:73-85
Grammars with contexts are an extension of context-free grammars equipped with operators for referring to the left and the right contexts of a substring being defined. These grammars are notable for still having a cubic-time parsing algorithm, as wel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9fae104003f2c65483705933064c267
https://doi.org/10.1016/j.tcs.2017.11.006
https://doi.org/10.1016/j.tcs.2017.11.006
Autor:
Ion Petre, Mikhail Barash
Publikováno v:
Fundamenta Informaticae. 154:15-24
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e03cb489fd820b6dae70505774c5abe
https://doi.org/10.3233/fi-2017-1549
https://doi.org/10.3233/fi-2017-1549
Autor:
Alexander Okhotin, Mikhail Barash
Publikováno v:
Theory of Computing Systems. 61:581-605
The Generalized LR parsing algorithm for context-free grammars is notable for having a decent worst-case running time (cubic in the length of the input string, if implemented efficiently), as well as much better performance on “good” grammars. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bf522a081d89eb21df13b539e116ea3
https://doi.org/10.1007/s00224-016-9683-3
https://doi.org/10.1007/s00224-016-9683-3