Topic
Shunting-yard algorithm
About: Shunting-yard algorithm is a research topic. Over the lifetime, 3 publications have been published within this topic receiving 45 citations. The topic is also known as: Shunting-yard.
Papers
Proceedings Article•
11 Mar 2015TL;DR: A new approach for infix to postfix expressions conversion by following some rules is introduced and some of the applications and advantages of existing methods are highlighted.
Abstract: In Computer Science, Reverse Polish notation has simplified calculations and has benefited a new face to technology. Since 1960, RPN is used in calculators because its implementation is very easy and simple as well as it gives good performance. In this paper, we have introduced a new approach for infix to postfix expressions conversion by following some rules and highlighted some of the applications and advantages of existing methods. The proposed algorithm differs from other existing algorithms through its human readability. We have discussed a comparative analysis of RPN, Shunting Yard algorithm and a new approach to Post fix conversion named as PKR algorithm.
10 citations
1 Sep 2019
TL;DR: A method of parsing for relational algebra expressions, which is based on the use of reverse Polish notation (postfix notation), is proposed, which allows convert the operator of relational algebra into SQL queries.
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.
TL;DR: The left inverse of Reynolds' defunctionalization is presented and its relevance to programming and to programming languages is shown and it is illustrated with a recognizer for Dyck words and with Dijkstra's shunting-yard algorithm.
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2019 | 1 |
| 2015 | 1 |
| 2009 | 1 |