Re: Paralyzed by TDD
- From: jasongorman@xxxxxxxxxxxxxxxx
- Date: 26 Jul 2005 03:06:02 -0700
Phlip wrote:
>Could you pick a simpler learner project, like a recursive descent parser?
Actually, a directed graph is conceptually fairly simple, and should
lend itself well to practicing TDD - you don't have to worry too much
about understanding the problem because you can just open a book on
discrete maths and there it all is, ready made.
The previous replies make sense. Break the problem down by starting
with the simplest instance you can think of (an empty digraph, for
example), and then gradually add scenarios until every property of the
digraph is accounted for. This is the essence of TDD - start simple and
build up the design gradually with each new test case.
If your digraph was a design for a fitted kitchen, you might start by
asking "what would I need to boil an egg?", and then gradually work
your way to more complex recipes of which the simpler cases are
components (e.g., an omelette, a souffle, and so forth).
Does that make sense?
Jason Gorman
http://www.parlezuml.com
.
- Follow-Ups:
- Re: Paralyzed by TDD
- From: Phlip
- Re: Paralyzed by TDD
- References:
- Paralyzed by TDD
- From: kj
- Re: Paralyzed by TDD
- From: Ilja Preuß
- Re: Paralyzed by TDD
- From: Phlip
- Paralyzed by TDD
- Prev by Date: Re: Paralyzed by TDD
- Next by Date: Re: Merging beans for composite search
- Previous by thread: Re: Paralyzed by TDD
- Next by thread: Re: Paralyzed by TDD
- Index(es):