On Fri, 21 Jun 2002, guy keren wrote:
>
> On Fri, 21 Jun 2002, Muli Ben-Yehuda wrote:
>
> > As for the upcoming syscalltrack (<---- this is how it's written)
> > developers meeting, here is the tentative agenda with very tentative
> > times. If anyone wants to talk about anything else orhear about any
> > other subject, let me know.
>
> all in all - you plan for a 135 minutes meeting - assuming a 5-10 minute
> break in the middle, that's around 2.5+ hours.
>
> so it'll be 18:30 - 21:10 or so?
>
> btw, regarding gen_syscalls.pl - i could give a few minutes of
> explanations about how it works, and what i think we should do with it. i
> sugest we concentrate on how to design it, regardless of language, so
> we'll be focused, and not delve into language fights.
>
Fine by me. I think Perl _5_, Python, Ruby and C++ have enough in common
that we can make a good design that can be implemented in all of them.
(I'd rather not use Haskell for this kind of stuff...;-))
Naturally, some language specific features can make our life easier, but
we'll leave them to the implementation details.
To quote an ESR adaptation of what Fredrick Brooks said:
"Show me your [code] and conceal your [data structures], and I shall
continue to be mystified. Show me your [data structures], and I won't
usually need your [code]; it'll be obvious."
> > - syscalltrack
demonstration "in the wild". (15 minutes, Muli) >
> 10 minutes would be enough - it was already demonstrated a while back, in
> the syscalltrack lecture.
>
I suggest we query the audience and see if enough people want it. I
personally don't. My interest in syscalltrack is academic and at the
moment I could not care less for its actual functionality .
> > - technical discussions (30 minutes each)
> >
> > - the old device file design and the new device file design, with
> > explanations of linux special device files. (Muli).
> >
> > - shlomif's demonstration of lex & yacc (Shlomif)
> >
I estimate this will take about 30 minutes. I'd like to know in advance
how many people who are planning to attend the meeting aren't familiar
with either regular expressions or with formal languages (and with which
one they are not familiar). When I studied in High School they talked
about finite automata and formal languages during the 12th grade, and
that's how I learned it. (Despite the fact that I did not major in
Computer Science, I knew many people who did, and learned by following
their discussions)
Teaching people about them from the ground up would probably consume a lot
of time. I think the Yacc grammar is actually easier to understand than
the Lex regexps that can get a bit cryptic. Maybe I should take a top down
approach and show a complete grammar and then gradually teach what each
element does when I am being questioned for it. Those who wish to know
more will RTFM later.
Regards,
Shlomi Fish
> > - redesign of gen_syscalls.pl (30 minutes, everyone, brainstorming)
> >
> > - the future of syscalltrack - features and requisites for a 1.0
> > release. (15 minutes, Muli).
> >
> > - the far future. (15 minutes, Muli).
>
> these 2 could take 15 minutes together - unless a discussion (read:
> argumentative fights) will develope ;)
>
>
----------------------------------------------------------------------
Shlomi Fish [EMAIL PROTECTED]
Home Page: http://t2.technion.ac.il/~shlomif/
Home E-mail: [EMAIL PROTECTED]
He who re-invents the wheel, understands much better how a wheel works.
--------------------------------------------------------------------------
Haifa Linux Club Mailing List (http://linuxclub.il.eu.org)
To unsub send an empty message to [EMAIL PROTECTED]
