Try to create a DSL for a finite state machine.

Inspired by Chris vanBuskirk version on this site and the Ruby article at

http://www-128.ibm.com/developerworks/java/library/j-cb03137/index.html

A possible implementation of the Sieve of Eratosthenes for generating prime numbers below some limit.

Generate prime numbers blow some limit using the Sieve of Eratosthenes algorithm. This snippet uses some object abstractions to simplify the algorithm.

Generate prime numbers below some limit. This snippet uses groovy categories to locate the appropriate methods in common classes.

Generate prime numbers below some limit. This snippet incorporates some DSL like keywords to describe the prime algorithm.

The tests for the Sieve of Eratosthenes snippets.

SQL-like DSL for finding classes and methods

Sudoku solver in Groovy.

This example shows a build script written in Groovy using the AntBuilder.
No more angle bracket to bother you!

Using a JGroups ReplicatedHashtable from Groovy