Talk:Parsing/Shunting-yard algorithm: Difference between revisions
Content added Content deleted
(→Improve Description: It is about the shunting-yard algorithm which is described in the linked-to article.) |
|||
| Line 7: | Line 7: | ||
<nowiki>{{improved}}</nowiki>! --[[User:Paddy3118|Paddy3118]] 05:47, 6 December 2011 (UTC) |
<nowiki>{{improved}}</nowiki>! --[[User:Paddy3118|Paddy3118]] 05:47, 6 December 2011 (UTC) |
||
== Improve Description == |
== Improve Description == |
||
This seems to be about infix to RPN but it doesn't say it explicitly. --[[User:Dgamey|Dgamey]] 04:00, 13 December 2011 (UTC) |
|||
:Hi Dgamey, from the wikipedia article: |
|||
::''"In computer science, the shunting-yard algorithm is a method for parsing mathematical expressions specified in infix notation. It can be used to produce output in Reverse Polish notation (RPN) or as an abstract syntax tree (AST)."'' |
|||
:The title reflects that it is this shunting-yard algorithm that is to be used in transforming infix to, in this case, RPN. --[[User:Paddy3118|Paddy3118]] 09:07, 13 December 2011 (UTC) |
|||