Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Relaxed parsing of regular approximations of string-embedded languages. / Grigorev, Semyon; Avdyukhin, Dmitry.
Perspectives of System Informatics - 10th International Andrei Ershov Informatics Conference, PSI 2015, Revised Selected Papers. ed. / Manuel Mazzara; Andrei Voronkov. Springer Nature, 2016. p. 291-302 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9609).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Relaxed parsing of regular approximations of string-embedded languages
AU - Grigorev, Semyon
AU - Avdyukhin, Dmitry
PY - 2016/1/1
Y1 - 2016/1/1
N2 - 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.
AB - 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.
KW - Parser generator
KW - Parsing
KW - RNGLR
KW - String analysis
KW - String-embedded languages
UR - http://www.scopus.com/inward/record.url?scp=84978955012&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-41579-6_22
DO - 10.1007/978-3-319-41579-6_22
M3 - Conference contribution
AN - SCOPUS:84978955012
SN - 9783319415789
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 291
EP - 302
BT - Perspectives of System Informatics - 10th International Andrei Ershov Informatics Conference, PSI 2015, Revised Selected Papers
A2 - Mazzara, Manuel
A2 - Voronkov, Andrei
PB - Springer Nature
T2 - 10th International Andrei Ershov Informatics Conference on Perspectives of System Informatics, PSI 2015
Y2 - 24 August 2015 through 27 August 2015
ER -
ID: 48535243