Notes from the OkC Dojo 2009-09-30

Brett Schuchert — Wed, 30 Sep 2009 22:57:00 -0500

Tonight we had a small group of die-hard practitioners working with Ruby and RSpec. We intended to use the Randori style, but it was a small enough group that we were a bit more informal than that.

We tried the Shunting Yard Algorithm again and it worked out fairly well. The level of experience in Ruby was low to moderate (which is why we wanted to get people a chance to practice it) and the RSpec experience was generally low (again, great reason to give it a try).

We had several interesting (at least to me) side discussions on things such as:

Forth
Operator precedence
Operator associativity
L-Values and R-Values
Directed Acyclic Graphis
In-fix, pre-fix, post-fix binary tree traversal
Abstract Syntax Trees (AST)
The list goes on, I’m a big-time extrovert, so I told Chad to occasionally tell me to shut the heck up

The Shunting Yard Algorithm is a means of translating an in-fix expression into a post-fix expression (a.k.a. reverse polish notation – used by the best calculators in the world, HP [I also prefer vi, fyi!-] ). For example:

1 + 3 becomes 1 3 +
a = b = 17 becomes a b 17 = =
2 + 3 * 5 becomes 2 3 5 * +
2 * 3 + 5 becomes 2 3 * 5 +

One typical approach to this problem is to develop an AST from the in-fix representation and then recursively traversing the AST using a recursive post-fix traversal.

What I like about he Shunting Yard Algorithm is it takes a traditionally recursive algorithm (DAG traversal, where a binary tree is a degenerate DAG) and writes it iteratively using it’s own stack (local or instance variable) storage versus using the program stack to store activation records (OK stack frames). Essentially, the local stack is used for pending work.

This is one of those things I think is a useful skill to learn: writing traditionally recursive algorithms using a stack-based approach. This allows you to step through something (think iteration) versus having to do things whole-hog (recursively, with a block (lambda) passed in). In fact, I bought a used algorithm book 20 years ago because it had a second on this subject. And looking over my left shoulder, I just saw that book. Nice.

To illustrate, here’s the AST for the first example:

Since the group had not done a lot with recursive algorithms (at least not recently), we discussed a short hand way to remember the various traversal algorithms using three letters: L, R, P

L -> Go Left
R -> Go Right
P -> Print (or process)

Each of the three traditional traversal algorithms (for a binary tree) use just these three letters. And the way to remember each is to put the ‘p’ where the name suggests. For example:

in-fix, in -> in between -> L P R
pre-fix, pre, before -> P L R
post-fix, post, after -> L R P

Then, given the graph above, you can traverse it as follows:

in-fix: Go left, you hit the 1, it’s a leaf note so print it, go up to the +, print it, go to the right, you end up with 1 + 3
post-fix: Go left you hit the 1, it’s a leaf node, print it, go back to the +, since this is post-fix, don’t print yet, go to the right, you get the 3, it’s a leaf node, print it, then finally print the +, giving: 1 3 +
pre-fix: start at + and print it, then go left, it’s a leaf note, print it, go right, it’s a leaf node, print it, so you get: + 1 3 – which looks like a function call (think operator+(1, 3))

It’s not quite this simple – we actually looked at larger examples – but this gets the essence across. And to move from a tree to a DAG, simply iterate over all children, printing before or after the complete iteration; in-fix doesn’t make as much sense in a general DAG. We also discussed tracking the visited nodes if you’ve got a graph versus an acyclic graph.

After we got a multi-operator expression with same-precedence operators working, e.g., 1 + 3 – 2, which results in: 1 3 + 2 -, we moved on to handling different operator precedence.

Around this time, there was some skepticism that post-fix could represent the same expression as in-fix. This is normal, if you have not seen these kinds of representations. And let’s be frank, how often do most of us deal with these kinds of things? Not often.

Also, there was another question: WHY?

In a nutshell, with a post-fix notation, you do not need parentheses. As soon as an operator is encountered, you can immediately process it rather than waiting until the next token to complete the operator (no look-ahead required). This also led to HP developing a calculator in 1967 (or ‘68) that was < 50 pounds and around USD $5,000 that could add, subtract, multiply and divide, which was huge at the time (with a stack size of 3 – later models went to a stack size of 4, giving us the x, y, z and t registers).

During this rat-hole, we discussed associativity. For example, a = b = c is really (a = (b = c))

That’s because the assignment operator is right-associative. This lead into r-values and l-values.

Anyway, we’re going to meet again next week. Because we (read this as me) were not disciplined in following the Randori style, these side discussions lead to taking a long to fix a problem. We should have “hit the reset button” sooner, so next time around we’re going to add a bit more structure to see what happens:

The driver finishes by writing a new failing test.
The driver commits the code with the newest failing test (we’ll be using git)
Change drivers and give him/her some time-box (5 – 10 minutes)
If, at the end of the current time-box, the current driver has all tests passing, go back to the first bullet in this list.
If at the end, the same test that was failing is still failing, (fist time only) give them a bit more time.
However, if any other tests are failing, then we revert back to the last check in and switch drivers.

Here’s an approximation of these rules using yuml.me:

And here’s the syntax to create that diagram:

(start)->(Create New Failing Test)->(Commit Work)->(Change Drivers)
(Change Drivers)->(Driver Working)
(Driver Working)-><d1>[tick]->(Driver Working)
<d1>[alarm]->(Check Results)->([All Tests Passing])->(Create New Failing Test)
(Check Results)->([Driver Broke Stuff])->(git -reset hard)->(Change Drivers)
(Check Results)->([First Time Only and Still Only Newest Test Failing])->(Give Driver A Touch More Time)->(Check Results)

Note that this is not a strict activity diagram, the feature is still in beta, and creating this diagram as I did made the results a bit more readable. Even so, I like this tool so I wanted to throw another example in there (and try out this diagram type I have not used before – at least not with this tool, I’ve created too many activity diagrams). If you’d like to see an accurate activity diagram, post a comment and I’ll draw one in Visio and post it.

Anyway, we’re going to try to move to a weekly informal practice session with either bi-weekly or monthly “formal” meetings. We’ll keep switching out the language and the tools. I’m even tempted to do design sessions – NO CODING?! What?! Why not. Some people still work that way, so it’s good to be able to work in different modes.

If you’re in Oklahoma City, hope to see you. If not, and I’m in your town, I’d be interested in dropping into your dojos!

"Notes from the OkC Dojo 2009-09-30" by louis vuitton

Tue, 22 Jun 2010 23:00:10 -0500

*Well , the view of the passage is totally correct ,your details is really reasonable and you guy give us valuable informative post, I totally agree the standpoint of upstairs . http://www.precision-mechanical.net I often surfing on this forum when I m free and I find there are so much good information we can learn in this forum!

"Notes from the OkC Dojo 2009-09-30" by AVI to ipad

Tue, 22 Jun 2010 05:39:17 -0500

Are you planning to have more meetings with your Randori group? I would be very interested if you

"Notes from the OkC Dojo 2009-09-30" by Carter

Thu, 20 May 2010 01:05:29 -0500

Are you planning to have more meetings with your Randori group? I would be very interested if you are holding another conference anytime soon. Please update.

mba essay samples

"Notes from the OkC Dojo 2009-09-30" by Daniel

Wed, 19 May 2010 12:56:20 -0500

Thanks for sharing about your so-called informal gathering. It is good to know that the gathering is successful and productive.

writing jobs philippines

"Notes from the OkC Dojo 2009-09-30" by Speed Dating New York

Tue, 11 May 2010 09:38:33 -0500

We are what we repeatedly do. Excellence, therefore, is not an act but a habit.

"Notes from the OkC Dojo 2009-09-30" by Ukraine Scammers

Wed, 28 Apr 2010 03:55:09 -0500

I don’t advocate practicing moves on someone who is untrained in Aikido and/or without safety mats, but if you have access to both of those things, then that is the best way. Most of us don’t though.

"Notes from the OkC Dojo 2009-09-30" by Russian Wife

Wed, 14 Apr 2010 06:45:03 -0500

It’s not quite this simple – we actually looked at larger examples – but this gets the essence across.

"Notes from the OkC Dojo 2009-09-30" by FLV extractor

Wed, 07 Apr 2010 03:47:00 -0500

it is really goosd

"Notes from the OkC Dojo 2009-09-30" by disney restaurants

Wed, 31 Mar 2010 01:47:12 -0500

When life becomes a challenge visit Positive Share for wisdom. You did it very well…

"Notes from the OkC Dojo 2009-09-30" by iphone fix

Tue, 09 Mar 2010 21:29:11 -0600

how abstract foe me.

"Notes from the OkC Dojo 2009-09-30" by gucci louis vuitton shoes

Tue, 15 Dec 2009 21:16:05 -0600

Welcome to Freshstyleshop, the hottest urban clothing site on the net! We offer great products from Gucci sneakers, prada sneakers, LV shoes, True Religion Jeans and many more! Our selection of products are always increasing for the fact that we have new items added weekly to our selection. All products on our site are already marked down 40-60% off retail price. Freshstyleshop also backs all its orders with a 110% satisfaction guarantee, making sure that our customers are left satisfied with the hottest products on the net.

"Notes from the OkC Dojo 2009-09-30" by sikistubetk@gmail.com

Thu, 29 Oct 2009 15:09:09 -0500

thanks for all admin to share the most beautiful treasure siki?

"Notes from the OkC Dojo 2009-09-30" by Brett L. Schuchert

Thu, 01 Oct 2009 10:44:13 -0500

Doh! Thanks sam.

Fixed. Along with not having a preview and the rest of the body!

"Notes from the OkC Dojo 2009-09-30" by Sam

Thu, 01 Oct 2009 02:15:47 -0500

BTW, it’s Forth, not Fourth. :) The name of the language came from the IBM minicomputer’s 5-character filename limitation.

Object Mentor Blog: Notes from the OkC Dojo 2009-09-30