Anonymous user
Talk:Parsing/Shunting-yard algorithm: Difference between revisions
Talk:Parsing/Shunting-yard algorithm (view source)
Revision as of 14:45, 13 December 2011
, 12 years ago→Improve Description: was a minor nit only
(→Improve Description: It is about the shunting-yard algorithm which is described in the linked-to article.) |
m (→Improve Description: was a minor nit only) |
||
Line 12:
::''"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)
:: It's a minor nit I know but it didn't say it. I made a slight tweak in the description. Not everybody knows algorithms by name or remembers if they have broader application. Nor does everyone read the WP article. (Good set of tasks though). --[[User:Dgamey|Dgamey]] 14:45, 13 December 2011 (UTC)
| |||