() Mark H Weaver m...@netris.org
() Thu, 17 Mar 2011 21:38:28 -0400
If we may assume that the searched string is valid UTF-8, and when only
ASCII characters are excluded (e.g. .), then three additional states
are required in the generated DFA. Let us call them S1, S2, and S3.
Hello Andy!
Andy Wingo wi...@pobox.com writes:
On Sun 06 Mar 2011 23:12, l...@gnu.org (Ludovic Courtès) writes:
Neil Jerram n...@ossau.uklinux.net writes:
In principle, how should Guile 2.0 be cross-compiled? I'm thinking
mostly of the part of the build that compiles all the installed
Thien-Thi Nguyen t...@gnuvola.org writes:
() Mark H Weaver m...@netris.org
() Thu, 17 Mar 2011 21:38:28 -0400
If we may assume that the searched string is valid UTF-8, and when only
ASCII characters are excluded (e.g. .), then three additional states
are required in the generated
Hi Mark,
On Wed 09 Mar 2011 07:48, Mark H Weaver m...@netris.org writes:
Attached are two minimal C programs. Both create threads that do
nothing but sleep for 2 seconds and then exit. The parent tries to join
with the child thread, with a timeout of 10 seconds.
The only difference is
Hello all,
I recently ran up against an issue about modules with circular
dependencies while working on PEG stuff. I reduced it to the following
test case.
Here is file test-a.scm:
(define-module (test-a)
#:use-module (test-b))
(define-syntax hello
(syntax-rules ()
((hello) Hello,
Hello!
The problem is that modules are resolved at compile-time, in addition to
run-time, so there just can’t be circular dependencies.
Besides, I think it’s generally a problem from an engineering viewpoint
when cycles are introduced.
So my feeling is that Guile should be able to detect cycles
Hello,
The problem is that modules are resolved at compile-time, in addition to
run-time, so there just can’t be circular dependencies.
It's true that a module couldn't depend, at compile-time, on a module
that was only available at run-time. However, I think we could handle
circular
