What’s more, PCRE lets you either recurse the entire regex pattern, or a part of the pattern, i.e., the regex contained by a set of parentheses, referenced by its capture group number.

I saw your “Edit 2″ section, here’s a comprehensive resource about recursive regular expressions. But only for PHP.

Only a matter of time before the feature is implemented in Java.

I’ve found a site dedicated to grooming.

Dog grooming refers to both the hygienic care and cleaning of a dog, as well as a process by which a dog’s physical appearance is enhanced for showing or other types of competition. A dog groomer (or simply “groomer”) is a person who earns their living grooming dogs.

Grooming is an important part of dog care. Depending on the breed, age, and health of the dog, grooming may be a daily activity. Many breeds require significantly less grooming than this, but regular grooming helps to ensure the dog is healthy and comfortable. It is important to note that while many dogs shed, others (such as the Poodle), do not shed (see Moult) as profusely, and require grooming by a professional every 6–8 weeks maximum.

Dogs can be bathed by being sprayed with a hand-held shower head, or doused with water from a bucket. Often, one bath will not make a dog truly clean. A second bath is excellent to ensure the entire body has been cleaned. Dogs should be bathed with warm, not hot water, in order to make it a more enjoyable experience. Dogs with a heavy or matted coat should never be bathed without first being completely brushed out or clipped of any mats.

Psi salon

It’s written in Polish but still have profoundly nice gallery of dogs and cats.
They use many products such as ones of Ring 5, 1 All System, Bio-Groom to take care of your pupil.

Bye to every one!

Regexes can match any fixed patterns (i.e. finite patterns) including any finite level of recursion. Pure regexes cannot match arbitrary level of recursion (i.e. infinite level of recursion). Such infinite things require more than single “memory” (e.g. “balancing groups” i.e. “stack”) or more powerful “memory” (e.g. “counter” which is more than finite state translation).

You can use regexes to match any fixed patterns because you can hard-code any fixed patterns in regexes at least.