Relaxed Parsing of Regular Approximations of String-Embedded Languages

  • Ekaterina Verbitskaia
  • Semyon Grigorev
  • Dmitry Avdyukhin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9609)

Abstract

We present a technique for syntax analysis of a regular set of input strings. This problem is relevant for the analysis of string-embedded languages when a host program generates clauses of embedded language at run time. Our technique is based on a generalization of RNGLR algorithm, which, inherently, allows us to construct a finite representation of parse forest for regularly approximated set of input strings. This representation can be further utilized for semantic analysis and transformations in the context of reengineering, code maintenance, program understanding etc. The approach in question implements relaxed parsing: non-recognized strings in approximation set are ignored with no error detection.

Keywords

String-embedded languages String analysis Parsing Parser generator RNGLR 

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Ekaterina Verbitskaia
    • 1
  • Semyon Grigorev
    • 1
  • Dmitry Avdyukhin
    • 1
  1. 1.Saint Petersburg State UniversitySaint PetersburgRussia

Personalised recommendations