Re: Hints on recursion
- From: Pascal Bourguignon <spam@xxxxxxxxxxxxxxxx>
- Date: Tue, 29 Nov 2005 19:08:13 +0100
"zion_zii" <nick.kigs@xxxxxxxxx> writes:
> Whoa Pascal !
>
> First of all the problem should have been "..return true if a occurs
> atleast twice in the list.." and not twice. My error = my apologies.
> (Does this make it simpler?)
Yes, at least twice is simplier than exactly twice.
At least twice: ^.*e.*e
Exactly twice: ^[^e]*e[^e]*e[^e]*$
> Im on page 15 of the book and I dont think they expected me to know all
> that (Incidentally, Im just beginning with the basic constructs e.g
> cons, car,cdr etc and dont know much) What is a DFA?
Deterministic Finite Automaton.
It's the mathematical objects behind regular expressions.
> All in all its good to know I can get help here as I tread on the
> supposedly rewarding path of lisp programming. Merci beaucoup pour
> votre aide.
--
__Pascal Bourguignon__ http://www.informatimago.com/
In deep sleep hear sound,
Cat vomit hairball somewhere.
Will find in morning.
.
- References:
- Hints on recursion
- From: zion_zii
- Re: Hints on recursion
- From: Pascal Bourguignon
- Re: Hints on recursion
- From: zion_zii
- Hints on recursion
- Prev by Date: Re: OT to the extreme
- Next by Date: Re: Another conversion to C or Java...
- Previous by thread: Re: Hints on recursion
- Next by thread: Re: Hints on recursion
- Index(es):
Relevant Pages
|
|
