Skip to main content
SpringerLink
Log in

DSL for Grammar Refactoring Patterns

  • Chapter
  • First Online:
Central European Functional Programming School (CEFP 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8606))

Included in the following conference series:

  • 798 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Klint, P., Lämmel, R., Verhoef, C.: Toward an engineering discipline for grammarware. ACM Trans. Softw. Eng. Methodol. (TOSEM) 14(3), 331–380 (2005)

    Article  Google Scholar 

  2. 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)

    Google Scholar 

  3. Halupka, I., Kollár, J., Pietriková, E.: A task-driven grammar refactoring algorithm. Acta Polytech. 52(5), 51–57 (2012)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Lämmel, R.: Grammar adaptation. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 550–570. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Louden, K.: Compiler Construction: Principles and Practice. PWS Publishing, Boston (1997)

    Google Scholar 

  8. 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)

    Article  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Mernik, M., Heering, J., Sloane, A.M.: When and how to develop domain-specific languages. ACM Comput. Surv. 37(4), 316–344 (2005)

    Article  Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. 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)

    Article  Google Scholar 

Download references

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

  1. Technical University of Košice, Letná 9, 04200, Košice, Slovakia

    Ivan Halupka

Authors
  1. Ivan Halupka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Halupka .

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary

    Viktória Zsók

  2. Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary

    Zoltán Horváth

  3. Faculty of Mathematics and Informatics, Babeş-Bolyai University, Cluj-Napoca, Romania

    Lehel Csató

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation