Abstract
Grammar refactoring is a significant cornerstone of grammarware engineering, aimed at adjusting a formal grammar to specific requirements derived from the application environment, without affecting the language that a grammar generates. In our research, we focus on tackling the problems related to formal specification and automated application of well-known and newly-discovered refactoring procedures. One of our research results is a language for specification of the refactoring patterns to which we refer to as pLERO. In this paper, we present an extension of pLERO language aimed at expanding the scope of its applicability to additional classes of refactoring problems, such as folding and unfolding of grammar productions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Klint, P., Lämmel, R., Verhoef, C.: Toward an engineering discipline for grammarware. ACM Trans. Softw. Eng. Methodol. (TOSEM) 14(3), 331–380 (2005)
Halupka, I., Kollár, J.: Evolutionary algorithm for automated task-driven grammar refactoring. In: Proceedings of International Scientific Conference on Computer Science and Engineering (CSE 2012), pp. 47–54. Technical University of Košice, Slovakia (2012)
Halupka, I., Kollár, J., Pietriková, E.: A task-driven grammar refactoring algorithm. Acta Polytech. 52(5), 51–57 (2012)
Kollár, J., Halupka, I.: Role of patterns in automated task-driven grammar refactoring. In: 2nd Symposium on Languages, Applications and Technologies (SLATE 2013), pp. 171–186. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2013)
Kollár, J., Halupka, I., Chodarev, S., Pietriková, E.: pLERO: language for grammar refactoring patterns. In: 4th Workshop on Advances in Programming Languages (WAPL 2013), Kraków, Poland (in print)
Lämmel, R.: Grammar adaptation. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 550–570. Springer, Heidelberg (2001)
Louden, K.: Compiler Construction: Principles and Practice. PWS Publishing, Boston (1997)
Lohmann, W., Riedewald, G., Stoy, M.: Semantics-preserving migration of semantic rules during left recursion removal in attribute grammars. Electron. Notes Theoret. Comput. Sci. (ENTCS) 110, 133–148 (2004)
Kraft, N., Duffy, E., Malloy, B.: Grammar recovery from parse trees and metrics-guided grammar refactoring. IEEE Trans. Softw. Eng. 35(6), 780–794 (2009)
Lämmel, R., Zaytsev, V.: An introduction to grammar convergence. In: Leuschel, M., Wehrheim, H. (eds.) IFM 2009. LNCS, vol. 5423, pp. 246–260. Springer, Heidelberg (2009)
Mernik, M., Heering, J., Sloane, A.M.: When and how to develop domain-specific languages. ACM Comput. Surv. 37(4), 316–344 (2005)
Stevenson, A., Cordy, J.R.: Grammatical inference in software engineering: an overview of the state of the art. In: Czarnecki, K., Hedin, G. (eds.) SLE 2012. LNCS, vol. 7745, pp. 204–223. Springer, Heidelberg (2013)
D’ulizia, A., Ferri, F., Grifoni, P.: A learning algorithm for multimodal grammar inference. IEEE Trans. Syst. Man, Cybern. - Part B 41(6), 1495–1510 (2011)
Acknowledgments
This work was supported by project VEGA 1/0341/13 Principles and methods of automated abstraction of computer languages and software development based on the semantic enrichment caused by communication.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Halupka, I. (2015). DSL for Grammar Refactoring Patterns. In: Zsók, V., Horváth, Z., Csató, L. (eds) Central European Functional Programming School. CEFP 2013. Lecture Notes in Computer Science(), vol 8606. Springer, Cham. https://doi.org/10.1007/978-3-319-15940-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-15940-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15939-3
Online ISBN: 978-3-319-15940-9
eBook Packages: Computer ScienceComputer Science (R0)