Concrete Syntax-Based Find

Concrete Syntax-Based Find for Graphical Domain Specific Languages



Find is a typical service in textual tools. However, textual queries are not suitable for searching in graph structures such as models of graph-based domain-specific languages. With textual queries, it is difficult to restrict the scope of the query or to search for a graph structure. Therefore, we propose to use a concrete syntax-based find instead. To support it in various DSLs, the concrete syntax-based find is provided as a service of a DSL tool definition framework. Using the concrete syntax-based find, it is possible to find answers faster and with higher accuracy than without the find service. We have also extended the concrete syntax-based find to support concrete syntax-based find-replace. The approach has been implemented in the web-based DSL tool development framework ajoo.

Source code is available at github repository .

Set up instruction

Install Meteor;

Download project source code;

Run "meteor" in the project folder;

If there is error run "meteor npm install --save @babel/runtime";

Run "meteor" again;

Open http://localhost:3000/ in the browser.


E. Kalnina and A. Sostaks, Towards Concrete Syntax Based Find for Graphical Domain Specific Languages, 2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C), 2019, pp. 236-242. DOI: 10.1109/MODELS-C.2019.00038.

E. Kalnina, Concrete syntax-based find for graphical DSLs, In Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings (MODELS '20), 2020, Association for Computing Machinery, New York, NY, USA, Article 11, pp. 1–5. DOI:https://doi.org/10.1145/3417990.3422008

E. Kalnina, D. Kosarevskis and A. Sostaks Find-Replace as a Service of Graph-Based DSL ToolDevelopment Framework, To appear In Proceedings of the 1st International Workshop on Foundations and Practice of Visual Modeling, Bergen, 22 June, 2021 co-located with STAF 2021, CEUR Workshop Proceedings, 2021

E. Kalnina Konkrētā sintaksē balstīta meklēšana, Populārzinātniska publikācija, 2021 (Popular science publication in Latvian.)


elina.kalnina (et) lumii.lv

The Institute of Mathematics and Computer Science, University of Latvia (IMCS UL)