GLR-based abstract parsing

Authors:
Semen Grigorev;Iakov Kirilenko
Affiliations:
St. Petersburg State University, St. Petersburg, Russia;St. Petersburg State University, St. Petersburg, Russia
Venue:
Proceedings of the 9th Central & Eastern European Software Engineering Conference in Russia
Year:
2013

Citing 8
Cited 0

Static approximation of dynamically generated Web pages

WWW '05 Proceedings of the 14th international conference on World Wide Web
Right nulled GLR parsers

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Static Analysis Framework For Detecting SQL Injection Vulnerabilities

COMPSAC '07 Proceedings of the 31st Annual International Computer Software and Applications Conference - Volume 01
A Static Analysis Framework for Database Applications

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Precise analysis of string expressions

SAS'03 Proceedings of the 10th international conference on Static analysis
An interactive tool for analyzing embedded SQL queries

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Parsing Techniques: A Practical Guide

Parsing Techniques: A Practical Guide

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract parsing is an important step of the processing of dynamically constructed statements or string-embedded languages (such as embedded or dynamic SQL). Existing LALR-based algorithms have performance issues. To increase performance we propose to use a GLR-algorithm as a base for abstract parsing and to reuse graph-structured stack and shared packed parse forest. RNGLR-algorithm modification for abstract parsing is presented.