Geodesic
IDE support of string-embedded languages
Modelirovanie i analiz informacionnyh sistem, Tome 21 (2014) no. 6, pp. 131-143.

Voir la notice de l'article provenant de la source Math-Net.Ru

Complex information systems are often implemented by using more than one programming language. Sometimes this variety takes a form of one host and one or few string-embedded languages. Textual representation of clauses in a string-embedded language is built at run time by a host program and then analyzed, compiled or interpreted by a dedicated runtime component (database, web browser etc.) Most general-purpose programming languages may play the role of the host; one of the most evident examples of the string-embedded language is the dynamic SQL which was specified in ISO SQL standard and is supported by the majority of DBMS. Standard IDE functionality such as code completion or syntax highlighting can really helps the developers who use this technique. There are several tools providing this functionality, but they all process only one concrete string-embedded language and cannot be easily extended for supporting another language. We present a platform which allows to easily create tools for string-embedded language processing.
Keywords: string-embedded language, abstract parsing, parser generator, lexer generator, integrated development environment, dynamic SQL.
Mots-clés : IDE 
@article{MAIS_2014_21_6_a11,
     author = {S. Grigorev and E. Verbitskaia and M. Polubelova and A. Ivanov and E. Mavchun},
     title = {IDE support of string-embedded languages},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {131--143},
     publisher = {mathdoc},
     volume = {21},
     number = {6},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2014_21_6_a11/}
}
TY  - JOUR
AU  - S. Grigorev
AU  - E. Verbitskaia
AU  - M. Polubelova
AU  - A. Ivanov
AU  - E. Mavchun
TI  - IDE support of string-embedded languages
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2014
SP  - 131
EP  - 143
VL  - 21
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2014_21_6_a11/
LA  - ru
ID  - MAIS_2014_21_6_a11
ER  - 
%0 Journal Article
%A S. Grigorev
%A E. Verbitskaia
%A M. Polubelova
%A A. Ivanov
%A E. Mavchun
%T IDE support of string-embedded languages
%J Modelirovanie i analiz informacionnyh sistem
%D 2014
%P 131-143
%V 21
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2014_21_6_a11/
%G ru
%F MAIS_2014_21_6_a11
S. Grigorev; E. Verbitskaia; M. Polubelova; A. Ivanov; E. Mavchun. IDE support of string-embedded languages. Modelirovanie i analiz informacionnyh sistem, Tome 21 (2014) no. 6, pp. 131-143. http://geodesic.mathdoc.fr/item/MAIS_2014_21_6_a11/

[1] Kirilenko Ya. A., Grigorev S. V., Avdyukhin D. A., “Razrabotka sintaksicheskikh analizatorov v proektakh po avtomatizirovannomu reinzhiniringu informatsionnykh sistem”, Nauchno-tekhnicheskie vedomosti SPbGPU: informatika, telekommunikatsii, upravlenie, 2013, no. 174, 94–98 (in Russian)

[2] Kyung-Goo Doh, H. Kim, A. S.David, “Abstract parsing: Static analysis of dynamically generated string output using lr-parsing technology”, Proceedings of the 16th International Symposium on Static Analysis, SAS'09, Springer-Verlag, Berlin–Heidelberg, 2009, 256–272 | MR

[3] A. Annamaa, A. Breslav, V. Varmo, “Using abstract lexical analysis and parsing to detect errors in string-embedded dsl statements”, Proceedings of the 22nd Nordic Workshop on Programming Theory, eds. M. Walden, L. Petre

[4] Mohri Mehryar, Finite-State Transducers in Language and Speech Processing, , Association for Computational Linguistics, 1997 http://www.cs.nyu.edu/\allowbreakm̃ohri/pub/cl1.pdf | MR

[5] Ivanov A. V., Vosstanovlenie posle oshibok v GLR-algoritme, Kursovaya rabota, SPbGU, 2013 (in Russian)

[6] Verbitskaya E. A., Grigorev S. V., “Abstraktnyy leksicheskiy analiz”, Materialy vserossiyskoy nauchnoy konferentsii po problemam informatiki, SPISOK-2013 (23–26 apr. 2013, Sankt-Peterburg), Izdatelstvo VVM, SPb., 2013, 792 (in Russian)

[7] E. Scott, A. Johnstone, “Right nulled GLR parsers”, ACM Trans. Program. Lang. Syst., 28:4, July (2006), 577–618 | DOI

[8] S. Grigorev, I. Kirilenko, “GLR-based abstract parsing”, Proceedings of the 9th Central Eastern European Software Engineering Conference in Russia, CEE-SECR '13 (NY, USA), Article 5, 9

[9] G. R. Economopoulos, Generalised LR parsing algorithms, 2006

[10] A. Terekhov, “Good technology makes the difficult task easy”, Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013, ACM, New York, USA, 683–686

[11] D. Yu. Boulychev, D. V. Koznov, A. A. Terekhov, “On Project-Specific Languages and Their Application in Reengineering”, Proceedings of the 6th European Conference on Software Maintenance and Reengineering, CSMR'02, IEEE Computer Society, Washington, DC, USA, 177–185

[12] S. Grigorev, I. Kirilenko, “From Abstract Parsing to Abstract Translation”, Preliminary Proceedings of the 8th Spring/Summer Young Researchers Colloquium on Software Engineering (2014), 135–139