Generalized table-based LL-parsing

Syntax analysis is an important step of code analysis. The problem is that the grammars have to be in a form which is deterministic, or at least near-deterministic for the chosen parsing technique. Generalized parsing algorithms — Generalized LR and Generalized LL (GLL) — make it possible to remove these restrictions. Abstract analysis makes it possible to parse embedded languages for supporting them in IDE, reengineering tasks, or finding vulnerabilities (SQL-injection). Abstract syntax analysis is based on the classic table-based analysis. The generalized algorithm of top-down parsing without the use of predictive tables was described earlier in order to extend the class of languages processed by descent analyzers. This paper describes an approach to creation of a table-based GLL-analyzer based on the proposed algorithm, which will be used later for an abstract analyzer. This article describes the algorithm of generalized top-down analysis, its modifications, and the results of comparison with the generalized bottom-up parsing algorithm, which was implemented earlier.