Processing of Relational Algebra Expressions by the Shunting Yard Algorithm

Abstract

The paper proposes a method of parsing for relational algebra expressions, which is based on the use of reverse Polish notation (postfix notation). The operation algorithm of the shunting yard, adapted for processing of operators RA, is presented. The tools of lexical analysis and the mechanism of building a syntax analyser for the language of relational algebra are presented. The algorithm of the software solution in Python is described, which allows convert the operator of relational algebra into SQL queries. Underpin of the data source for the implementation of relational algebra operators the relational database - SQLite.