Posted
by Tony
on Stack Overflow
See other posts from Stack Overflow
or by Tony
Published on 2010-06-16T10:22:04Z
Indexed on
2010/06/16
10:32 UTC
Read the original article
Hit count: 183
Would it be a true statement to say that every recursive function needs to be reentrant?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can someone give me the difference between these two kinds recursions and example?
specifically in ocaml. Thanks
>>> More
as seen on Programmers
- Search for 'Programmers'
I am about to make two assumptions. Please correct me if they're wrong:
There isn't a recursive algorithm without an iterative equivalent.
Iteration is always cheaper performance-wise than recursion (at
least in general purpose languages such as Java, C++, Python etc.).
If it's true that recursion…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I solved Problem 10 of Project Euler with the following code, which works through brute force:
def isPrime(n):
for x in range(2, int(n**0.5)+1):
if n % x == 0:
return False
return True
def primeList(n):
primes = []
for i in range(2,n):
if isPrime(i):
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have this massive array of ints from 0-4 in this triangle. I am trying to learn dynamic programming with Ruby and would like some assistance in calculating the number of paths in the triangle that meet three criterion:
You must start at one of the zero points in the row with 70 elements.
Your…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
code 1:
public static int fibonacci (int n){
if (n == 0 || n == 1) {
return 1;
} else {
return fibonacci (n-1) + fibonacci (n-2);
}
}
how can you use fibonacci if you haven't gotten done explaining what it is yet? I've been able to understand…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Would it be a true statement to say that every recursive function needs to be reentrant?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm newbie to flex. I'm trying to write a simple re-entrant lexer/scanner with flex. The lexer definition goes below. I get stuck with compilation errors as shown below (yyg issue):
reentrant.l:
/* Definitions */
digit [0-9]
letter [a-zA-Z]
alphanum [a-zA-Z0-9]
identifier…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Does GCC generate reentrant code for all scenarios ?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Most of the times, the definition of reentrance is quoted from Wikipedia:
A computer program or routine is
described as reentrant if it can be
safely called again before its
previous invocation has been completed
(i.e it can be safely executed
concurrently). To be reentrant, a
computer…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello.
In simplistic terms, a feature structure is an unordered list of attribute-value pairs.
[number:sg, person:3 | _ ],
which can be embedded:
[cat:np, agr:[number:sg, person:3 | _ ] | _ ],
can subindex stuff and share the value
[number:[1], person:3 | _ ],
where [1] is another feature…
>>> More
