The shunting yard algorithm kata

After attending a code dojo randori with the Oslo XP meetup where we worked our way about half-way through the kata for the Shunting yard algorithm, I decided to have a go at finishing it completely in Java (which I am quite rusty at) and the trying it in Ruby (at which I am a total newbie) and examine the differences. Especially Javas somewhat sketchy regexp support was something that annoyed me, and Ruby excels at that part. The Shunting yad algorithm is an algorithm for transforming infix notation to reverse polish notation, often used for arithmetic expressions and takes operator precedence and associativity into account. blog comments powered by Disqus

Published

15 September 2009