libfsd-devel — Development issues

Re: [Libfsd-devel] Tva-onova

[Ivan P. <va...@ne...>]

Den, chas i mjasto? Az sum navit za proizvolen den drugata sedmica, samo da e 
sled 6.
Pesho -- kakvo stana s durzhavnija? Ot teb li shte sa birite?

On Wednesday 21 September 2005 13:32, Georgi Mungov wrote:
> edna bira drugata sedmica
>
> On Monday 19 September 2005 15:52, Ivan Peikov wrote:
> > ami ne che ne mozhe, obache povecheto algoritmi za koito se seshtam sa ot
> > vida: "ami stignah do njakakuv state i sega za vsichki states, do koito
> > imam transition ot tozi state napravi edi kakvo si". i za tova mi se
> > vidja naj-udachno (razbiraj efektivno) da imame direkten dostup do
> > transitionite ot vseki state
> >
> > On Monday 19 September 2005 15:38, Georgi Mungov wrote:
> > > ami moje bi vmesto list transitions v state-a da sa v multimap ?
> > >
> > > On Saturday 17 September 2005 10:37, Ivan Peikov wrote:
> > > > Privet!
> > > >
> > > > Za da ne zamira "proekta" (:]) dokato Pesho go trese predpizpitna
> > > > treska (uspeh, Pesho!), eto kakvo e polozhenieto i kakvi vuprosi me
> > > > zanimavat.
> > > >
> > > > Znachi do tuk imam implementnat parser-a na reguljarni izrazi, kojto
> > > > e pochti POSIX-compatible (ostavat mnogo malko featuri da se
> > > > dobavjat, ama za sega me murzi, puk i te sa njakvi dosta nenuzhni -
> > > > nikoga ne bjah chuval za collating sequences i equivallence classes v
> > > > reguljarni izrazi predi da procheta spesifikacijata). Taka che za
> > > > momenta tozi parser shte svurshi rabota. Edinstveno ostavat da se
> > > > napravjat testove i malko da se pozagladjat njakoi rubove :).
> > > >
> > > > Mislja che ottuk mozhem da zapochnem da pravim avtomatite. Struva mi
> > > > se naj-dobre da zapochnem s njakakuv vid general avtomati (GFA -
> > > > General Finite Automaton), kojto da e abstrakten i da njama azbuka.
> > > > Tuk idva purvijat vupros. Izglezhda edinstvenoto, koeto razlichava
> > > > vsichki vidove avtomati i transduceri za koito se seshtam e azbukata.
> > > > Primerno za NFA tova shte sa njakakvi simvoli, a za transducerite
> > > > azbukata sa dvojki ot naj-obshto simvol i output string. Toest
> > > > trjabva tozi GFA da se napravi taka che sled tova da mozhe s neshto
> > > > kato konfiguracija da se napravi proizvolen drug avtomat. Za momenta
> > > > varianta, do kojto sum go dobutal, e da ima slednite obekti
> > > >
> > > >
> > > > *************************************************************
> > > >
> > > > struct trans;
> > > > struct state;
> > > >
> > > > struct gfa {
> > > >   struct state *states; // Head of the list of states
> > > >   struct state *start; // Head of the list of starting states
> > > >   struct state *final; // Head of the list of final states
> > > >   pool_t state_pool; // Pool from which the states are allocated
> > > >   pool_t trans_pool; // Pool from which the transitions are allocated
> > > >   size_t state_nr;   // Number of states - used for assigning next
> > > > state id // --- Some overridable methods for managing transitions
> > > > ----------------- insert_func_t *insert; // Transition inserting
> > > > function remove_func_t *remove; // Transition removing function
> > > >   search_func_t *search; // Transition searching function
> > > >
> > > > };
> > > >
> > > > struct state {
> > > >   struct trans *incoming; // List of incoming transitions
> > > >   struct trans *outgoing; // List of outgoing transitions
> > > >   struct state *start; // Link in list of start states (NULL if
> > > > non-start) struct state *final; // Link in list of final states (NULL
> > > > if non-final) struct state *next;  // Link in list of all states
> > > >   struct gfa *parent; // The automaton this state is part of
> > > >   size_t id; // Id for dumping and accessing purposes
> > > >   // More stuff?...
> > > > };
> > > >
> > > > struct trans {
> > > >   struct state *src; // Where from
> > > >   struct state *dst; // Where to
> > > >   struct trans *src_next; // Link in the list of transitions for src
> > > >   struct trans *dst_next; // Link in the list of transitions for dst
> > > >   // Intentionally no symbol -- this is an abstract transition
> > > > };
> > > >
> > > > // --- Example: NFA transition
> > > >
> > > > struct nfa_trans {
> > > >   struct trans base; // Should be first for lists and casts to work
> > > >   char alpha;
> > > > };
> > > >
> > > >
> > > > *************************************************************
> > > >
> > > >
> > > >
> > > > Neshto ej takova.. Puk posle kato se initializira konkreten avtomat
> > > > shte se podava size-a na alphabet symbola i taka shte se inicializira
> > > > trans_pool. Sushto shte se podavat i konkretni funkcii za
> > > > insert/remove/search na transition, koito obshto vzeto shte vzimat
> > > > src_state, symbol, dst_state i shte pravjat kakvoto tam se nalaga.
> > > >
> > > > Tuk veche idva vuprosa za efektivnostta. Mozhe da vi pravi
> > > > vpechatlenie che baja pamet shte jade tova zhivotno, obache puk shte
> > > > ima vsichki neobhodimi vruzki, koeto se nadjavam da ulesni
> > > > algoritmite posle.
> > > >
> > > > Stoi sushto vuprosa kak shte sa podredeni transitionite za daden
> > > > state. Za momenta shte e dummy list bez nikakva naredba, obache se
> > > > seshtate che tova ni kachva slozhnostta na izpulnenie na avtomat
> > > > vurhu dadena duma. Tova e edna ot prichinite da zabija
> > > > insert/remove/search operaciite kato function pointers - edin vid
> > > > vseki konkreten avtomat shte si reshava kak da gi redi, i tursi.
> > > > Mozhe za momenta da gi ostavim po tozi nachin puk v budeshte ako se
> > > > poluchi mnogo tezhko naistina da mislim kak da se optimizira. Obshto
> > > > vzeto ima megdan.
> > > >
> > > >
> > > > Ta tova e obshto vzeto predlozhenieto za sega. Kakvo mislite?
> > > > Mozhe da obsudim na zhivo Pesho kato si vzeme durzhavnija s otlichie,
> > > > i bez tova shte trjabva da cherpi ne edna i dve biri po povoda :)
> > > >
> > > >
> > > > Ajde do kukane i pishete ako neshto
> > > >
> > > >
> > > >
> > > > -------------------------------------------------------
> > > > SF.Net email is sponsored by:
> > > > Tame your development challenges with Apache's Geronimo App Server.
> > > > Download it for free - -and be entered to win a 42" plasma tv or your
> > > > very own Sony(tm)PSP.  Click here to play:
> > > > http://sourceforge.net/geronimo.php
> > > > _______________________________________________
> > > > Libfsd-devel mailing list
> > > > Lib...@li...
> > > > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
> > >
> > > "Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
> > >  annotations on 09/19/05 05:46:51
> > > -----------------------------------------------------------------------
> > >-- -- --- This e-mail, including attachments, may include confidential
> > > and/or proprietary information, and may be used only by the person or
> > > entity to which it is addressed.  If the reader of this e-mail is not
> > > the intended recipient or his or her authorized agent, the reader is
> > > hereby notified that any dissemination, distribution or copying of this
> > > e-mail is prohibited. If you have received this e-mail in error, please
> > > notify the sender by replying to this message and delete this e-mail
> > > immediately.
> > > =======================================================================
> > >== == ===
> > >
> > >
> > >
> > > -------------------------------------------------------
> > > SF.Net email is sponsored by:
> > > Tame your development challenges with Apache's Geronimo App Server.
> > > Download it for free - -and be entered to win a 42" plasma tv or your
> > > very own Sony(tm)PSP.  Click here to play:
> > > http://sourceforge.net/geronimo.php
> > > _______________________________________________
> > > Libfsd-devel mailing list
> > > Lib...@li...
> > > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
> >
> > -------------------------------------------------------
> > SF.Net email is sponsored by:
> > Tame your development challenges with Apache's Geronimo App Server.
> > Download it for free - -and be entered to win a 42" plasma tv or your
> > very own Sony(tm)PSP.  Click here to play:
> > http://sourceforge.net/geronimo.php
> > _______________________________________________
> > Libfsd-devel mailing list
> > Lib...@li...
> > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
>
> "Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
>  annotations on 09/21/05 03:40:44
> ---------------------------------------------------------------------------
>--- This e-mail, including attachments, may include confidential and/or
> proprietary information, and may be used only by the person or entity to
> which it is addressed.  If the reader of this e-mail is not the intended
> recipient or his or her authorized agent, the reader is hereby notified
> that any dissemination, distribution or copying of this e-mail is
> prohibited. If you have received this e-mail in error, please notify the
> sender by replying to this message and delete this e-mail immediately.
> ===========================================================================
>===
>
>
>
> -------------------------------------------------------
> SF.Net email is sponsored by:
> Tame your development challenges with Apache's Geronimo App Server.
> Download it for free - -and be entered to win a 42" plasma tv or your very
> own Sony(tm)PSP.  Click here to play: http://sourceforge.net/geronimo.php
> _______________________________________________
> Libfsd-devel mailing list
> Lib...@li...
> https://lists.sourceforge.net/lists/listinfo/libfsd-devel

Re: [Libfsd-devel] Tva-onova

[Georgi M. <geo...@tu...>]

edna bira drugata sedmica

On Monday 19 September 2005 15:52, Ivan Peikov wrote:
> ami ne che ne mozhe, obache povecheto algoritmi za koito se seshtam sa ot
> vida: "ami stignah do njakakuv state i sega za vsichki states, do koito
> imam transition ot tozi state napravi edi kakvo si". i za tova mi se vidja
> naj-udachno (razbiraj efektivno) da imame direkten dostup do transitionite
> ot vseki state
>
> On Monday 19 September 2005 15:38, Georgi Mungov wrote:
> > ami moje bi vmesto list transitions v state-a da sa v multimap ?
> >
> > On Saturday 17 September 2005 10:37, Ivan Peikov wrote:
> > > Privet!
> > >
> > > Za da ne zamira "proekta" (:]) dokato Pesho go trese predpizpitna
> > > treska (uspeh, Pesho!), eto kakvo e polozhenieto i kakvi vuprosi me
> > > zanimavat.
> > >
> > > Znachi do tuk imam implementnat parser-a na reguljarni izrazi, kojto e
> > > pochti POSIX-compatible (ostavat mnogo malko featuri da se dobavjat,
> > > ama za sega me murzi, puk i te sa njakvi dosta nenuzhni - nikoga ne
> > > bjah chuval za collating sequences i equivallence classes v reguljarni
> > > izrazi predi da procheta spesifikacijata). Taka che za momenta tozi
> > > parser shte svurshi rabota. Edinstveno ostavat da se napravjat testove
> > > i malko da se pozagladjat njakoi rubove :).
> > >
> > > Mislja che ottuk mozhem da zapochnem da pravim avtomatite. Struva mi se
> > > naj-dobre da zapochnem s njakakuv vid general avtomati (GFA - General
> > > Finite Automaton), kojto da e abstrakten i da njama azbuka. Tuk idva
> > > purvijat vupros. Izglezhda edinstvenoto, koeto razlichava vsichki
> > > vidove avtomati i transduceri za koito se seshtam e azbukata. Primerno
> > > za NFA tova shte sa njakakvi simvoli, a za transducerite azbukata sa
> > > dvojki ot naj-obshto simvol i output string. Toest trjabva tozi GFA da
> > > se napravi taka che sled tova da mozhe s neshto kato konfiguracija da
> > > se napravi proizvolen drug avtomat. Za momenta varianta, do kojto sum
> > > go dobutal, e da ima slednite obekti
> > >
> > >
> > > *************************************************************
> > >
> > > struct trans;
> > > struct state;
> > >
> > > struct gfa {
> > >   struct state *states; // Head of the list of states
> > >   struct state *start; // Head of the list of starting states
> > >   struct state *final; // Head of the list of final states
> > >   pool_t state_pool; // Pool from which the states are allocated
> > >   pool_t trans_pool; // Pool from which the transitions are allocated
> > >   size_t state_nr;   // Number of states - used for assigning next
> > > state id // --- Some overridable methods for managing transitions
> > > ----------------- insert_func_t *insert; // Transition inserting
> > > function remove_func_t *remove; // Transition removing function
> > >   search_func_t *search; // Transition searching function
> > >
> > > };
> > >
> > > struct state {
> > >   struct trans *incoming; // List of incoming transitions
> > >   struct trans *outgoing; // List of outgoing transitions
> > >   struct state *start; // Link in list of start states (NULL if
> > > non-start) struct state *final; // Link in list of final states (NULL
> > > if non-final) struct state *next;  // Link in list of all states
> > >   struct gfa *parent; // The automaton this state is part of
> > >   size_t id; // Id for dumping and accessing purposes
> > >   // More stuff?...
> > > };
> > >
> > > struct trans {
> > >   struct state *src; // Where from
> > >   struct state *dst; // Where to
> > >   struct trans *src_next; // Link in the list of transitions for src
> > >   struct trans *dst_next; // Link in the list of transitions for dst
> > >   // Intentionally no symbol -- this is an abstract transition
> > > };
> > >
> > > // --- Example: NFA transition
> > >
> > > struct nfa_trans {
> > >   struct trans base; // Should be first for lists and casts to work
> > >   char alpha;
> > > };
> > >
> > >
> > > *************************************************************
> > >
> > >
> > >
> > > Neshto ej takova.. Puk posle kato se initializira konkreten avtomat
> > > shte se podava size-a na alphabet symbola i taka shte se inicializira
> > > trans_pool. Sushto shte se podavat i konkretni funkcii za
> > > insert/remove/search na transition, koito obshto vzeto shte vzimat
> > > src_state, symbol, dst_state i shte pravjat kakvoto tam se nalaga.
> > >
> > > Tuk veche idva vuprosa za efektivnostta. Mozhe da vi pravi vpechatlenie
> > > che baja pamet shte jade tova zhivotno, obache puk shte ima vsichki
> > > neobhodimi vruzki, koeto se nadjavam da ulesni algoritmite posle.
> > >
> > > Stoi sushto vuprosa kak shte sa podredeni transitionite za daden state.
> > > Za momenta shte e dummy list bez nikakva naredba, obache se seshtate
> > > che tova ni kachva slozhnostta na izpulnenie na avtomat vurhu dadena
> > > duma. Tova e edna ot prichinite da zabija insert/remove/search
> > > operaciite kato function pointers - edin vid vseki konkreten avtomat
> > > shte si reshava kak da gi redi, i tursi. Mozhe za momenta da gi ostavim
> > > po tozi nachin puk v budeshte ako se poluchi mnogo tezhko naistina da
> > > mislim kak da se optimizira. Obshto vzeto ima megdan.
> > >
> > >
> > > Ta tova e obshto vzeto predlozhenieto za sega. Kakvo mislite?
> > > Mozhe da obsudim na zhivo Pesho kato si vzeme durzhavnija s otlichie, i
> > > bez tova shte trjabva da cherpi ne edna i dve biri po povoda :)
> > >
> > >
> > > Ajde do kukane i pishete ako neshto
> > >
> > >
> > >
> > > -------------------------------------------------------
> > > SF.Net email is sponsored by:
> > > Tame your development challenges with Apache's Geronimo App Server.
> > > Download it for free - -and be entered to win a 42" plasma tv or your
> > > very own Sony(tm)PSP.  Click here to play:
> > > http://sourceforge.net/geronimo.php
> > > _______________________________________________
> > > Libfsd-devel mailing list
> > > Lib...@li...
> > > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
> >
> > "Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
> >  annotations on 09/19/05 05:46:51
> > -------------------------------------------------------------------------
> >-- --- This e-mail, including attachments, may include confidential and/or
> > proprietary information, and may be used only by the person or entity to
> > which it is addressed.  If the reader of this e-mail is not the intended
> > recipient or his or her authorized agent, the reader is hereby notified
> > that any dissemination, distribution or copying of this e-mail is
> > prohibited. If you have received this e-mail in error, please notify the
> > sender by replying to this message and delete this e-mail immediately.
> > =========================================================================
> >== ===
> >
> >
> >
> > -------------------------------------------------------
> > SF.Net email is sponsored by:
> > Tame your development challenges with Apache's Geronimo App Server.
> > Download it for free - -and be entered to win a 42" plasma tv or your
> > very own Sony(tm)PSP.  Click here to play:
> > http://sourceforge.net/geronimo.php
> > _______________________________________________
> > Libfsd-devel mailing list
> > Lib...@li...
> > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
>
> -------------------------------------------------------
> SF.Net email is sponsored by:
> Tame your development challenges with Apache's Geronimo App Server.
> Download it for free - -and be entered to win a 42" plasma tv or your very
> own Sony(tm)PSP.  Click here to play: http://sourceforge.net/geronimo.php
> _______________________________________________
> Libfsd-devel mailing list
> Lib...@li...
> https://lists.sourceforge.net/lists/listinfo/libfsd-devel

"Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
 annotations on 09/21/05 03:40:44
------------------------------------------------------------------------------
This e-mail, including attachments, may include confidential and/or proprietary information, and may be used only by the person or entity to which it is addressed.  If the reader of this e-mail is not the intended recipient or his or her authorized agent, the reader is hereby notified that any dissemination, distribution or copying of this e-mail is prohibited. If you have received this e-mail in error, please notify the sender by replying to this message and delete this e-mail immediately.
==============================================================================

Re: [Libfsd-devel] Tva-onova

[Ivan P. <va...@ne...>]

ami ne che ne mozhe, obache povecheto algoritmi za koito se seshtam sa ot 
vida: "ami stignah do njakakuv state i sega za vsichki states, do koito imam 
transition ot tozi state napravi edi kakvo si". i za tova mi se vidja 
naj-udachno (razbiraj efektivno) da imame direkten dostup do transitionite ot 
vseki state

On Monday 19 September 2005 15:38, Georgi Mungov wrote:
> ami moje bi vmesto list transitions v state-a da sa v multimap ?
>
> On Saturday 17 September 2005 10:37, Ivan Peikov wrote:
> > Privet!
> >
> > Za da ne zamira "proekta" (:]) dokato Pesho go trese predpizpitna treska
> > (uspeh, Pesho!), eto kakvo e polozhenieto i kakvi vuprosi me zanimavat.
> >
> > Znachi do tuk imam implementnat parser-a na reguljarni izrazi, kojto e
> > pochti POSIX-compatible (ostavat mnogo malko featuri da se dobavjat, ama
> > za sega me murzi, puk i te sa njakvi dosta nenuzhni - nikoga ne bjah
> > chuval za collating sequences i equivallence classes v reguljarni izrazi
> > predi da procheta spesifikacijata). Taka che za momenta tozi parser shte
> > svurshi rabota. Edinstveno ostavat da se napravjat testove i malko da se
> > pozagladjat njakoi rubove :).
> >
> > Mislja che ottuk mozhem da zapochnem da pravim avtomatite. Struva mi se
> > naj-dobre da zapochnem s njakakuv vid general avtomati (GFA - General
> > Finite Automaton), kojto da e abstrakten i da njama azbuka. Tuk idva
> > purvijat vupros. Izglezhda edinstvenoto, koeto razlichava vsichki vidove
> > avtomati i transduceri za koito se seshtam e azbukata. Primerno za NFA
> > tova shte sa njakakvi simvoli, a za transducerite azbukata sa dvojki ot
> > naj-obshto simvol i output string. Toest trjabva tozi GFA da se napravi
> > taka che sled tova da mozhe s neshto kato konfiguracija da se napravi
> > proizvolen drug avtomat. Za momenta varianta, do kojto sum go dobutal, e
> > da ima slednite obekti
> >
> >
> > *************************************************************
> >
> > struct trans;
> > struct state;
> >
> > struct gfa {
> >   struct state *states; // Head of the list of states
> >   struct state *start; // Head of the list of starting states
> >   struct state *final; // Head of the list of final states
> >   pool_t state_pool; // Pool from which the states are allocated
> >   pool_t trans_pool; // Pool from which the transitions are allocated
> >   size_t state_nr;   // Number of states - used for assigning next state
> > id // --- Some overridable methods for managing transitions
> > ----------------- insert_func_t *insert; // Transition inserting function
> >   remove_func_t *remove; // Transition removing function
> >   search_func_t *search; // Transition searching function
> >
> > };
> >
> > struct state {
> >   struct trans *incoming; // List of incoming transitions
> >   struct trans *outgoing; // List of outgoing transitions
> >   struct state *start; // Link in list of start states (NULL if
> > non-start) struct state *final; // Link in list of final states (NULL if
> > non-final) struct state *next;  // Link in list of all states
> >   struct gfa *parent; // The automaton this state is part of
> >   size_t id; // Id for dumping and accessing purposes
> >   // More stuff?...
> > };
> >
> > struct trans {
> >   struct state *src; // Where from
> >   struct state *dst; // Where to
> >   struct trans *src_next; // Link in the list of transitions for src
> >   struct trans *dst_next; // Link in the list of transitions for dst
> >   // Intentionally no symbol -- this is an abstract transition
> > };
> >
> > // --- Example: NFA transition
> >
> > struct nfa_trans {
> >   struct trans base; // Should be first for lists and casts to work
> >   char alpha;
> > };
> >
> >
> > *************************************************************
> >
> >
> >
> > Neshto ej takova.. Puk posle kato se initializira konkreten avtomat shte
> > se podava size-a na alphabet symbola i taka shte se inicializira
> > trans_pool. Sushto shte se podavat i konkretni funkcii za
> > insert/remove/search na transition, koito obshto vzeto shte vzimat
> > src_state, symbol, dst_state i shte pravjat kakvoto tam se nalaga.
> >
> > Tuk veche idva vuprosa za efektivnostta. Mozhe da vi pravi vpechatlenie
> > che baja pamet shte jade tova zhivotno, obache puk shte ima vsichki
> > neobhodimi vruzki, koeto se nadjavam da ulesni algoritmite posle.
> >
> > Stoi sushto vuprosa kak shte sa podredeni transitionite za daden state.
> > Za momenta shte e dummy list bez nikakva naredba, obache se seshtate che
> > tova ni kachva slozhnostta na izpulnenie na avtomat vurhu dadena duma.
> > Tova e edna ot prichinite da zabija insert/remove/search operaciite kato
> > function pointers - edin vid vseki konkreten avtomat shte si reshava kak
> > da gi redi, i tursi. Mozhe za momenta da gi ostavim po tozi nachin puk v
> > budeshte ako se poluchi mnogo tezhko naistina da mislim kak da se
> > optimizira. Obshto vzeto ima megdan.
> >
> >
> > Ta tova e obshto vzeto predlozhenieto za sega. Kakvo mislite?
> > Mozhe da obsudim na zhivo Pesho kato si vzeme durzhavnija s otlichie, i
> > bez tova shte trjabva da cherpi ne edna i dve biri po povoda :)
> >
> >
> > Ajde do kukane i pishete ako neshto
> >
> >
> >
> > -------------------------------------------------------
> > SF.Net email is sponsored by:
> > Tame your development challenges with Apache's Geronimo App Server.
> > Download it for free - -and be entered to win a 42" plasma tv or your
> > very own Sony(tm)PSP.  Click here to play:
> > http://sourceforge.net/geronimo.php
> > _______________________________________________
> > Libfsd-devel mailing list
> > Lib...@li...
> > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
>
> "Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
>  annotations on 09/19/05 05:46:51
> ---------------------------------------------------------------------------
>--- This e-mail, including attachments, may include confidential and/or
> proprietary information, and may be used only by the person or entity to
> which it is addressed.  If the reader of this e-mail is not the intended
> recipient or his or her authorized agent, the reader is hereby notified
> that any dissemination, distribution or copying of this e-mail is
> prohibited. If you have received this e-mail in error, please notify the
> sender by replying to this message and delete this e-mail immediately.
> ===========================================================================
>===
>
>
>
> -------------------------------------------------------
> SF.Net email is sponsored by:
> Tame your development challenges with Apache's Geronimo App Server.
> Download it for free - -and be entered to win a 42" plasma tv or your very
> own Sony(tm)PSP.  Click here to play: http://sourceforge.net/geronimo.php
> _______________________________________________
> Libfsd-devel mailing list
> Lib...@li...
> https://lists.sourceforge.net/lists/listinfo/libfsd-devel

Re: [Libfsd-devel] Tva-onova

[Georgi M. <geo...@tu...>]

ami moje bi vmesto list transitions v state-a da sa v multimap ?

On Saturday 17 September 2005 10:37, Ivan Peikov wrote:
> Privet!
>
> Za da ne zamira "proekta" (:]) dokato Pesho go trese predpizpitna treska
> (uspeh, Pesho!), eto kakvo e polozhenieto i kakvi vuprosi me zanimavat.
>
> Znachi do tuk imam implementnat parser-a na reguljarni izrazi, kojto e
> pochti POSIX-compatible (ostavat mnogo malko featuri da se dobavjat, ama za
> sega me murzi, puk i te sa njakvi dosta nenuzhni - nikoga ne bjah chuval za
> collating sequences i equivallence classes v reguljarni izrazi predi da
> procheta spesifikacijata). Taka che za momenta tozi parser shte svurshi
> rabota. Edinstveno ostavat da se napravjat testove i malko da se
> pozagladjat njakoi rubove :).
>
> Mislja che ottuk mozhem da zapochnem da pravim avtomatite. Struva mi se
> naj-dobre da zapochnem s njakakuv vid general avtomati (GFA - General
> Finite Automaton), kojto da e abstrakten i da njama azbuka. Tuk idva
> purvijat vupros. Izglezhda edinstvenoto, koeto razlichava vsichki vidove
> avtomati i transduceri za koito se seshtam e azbukata. Primerno za NFA tova
> shte sa njakakvi simvoli, a za transducerite azbukata sa dvojki ot
> naj-obshto simvol i output string. Toest trjabva tozi GFA da se napravi
> taka che sled tova da mozhe s neshto kato konfiguracija da se napravi
> proizvolen drug avtomat. Za momenta varianta, do kojto sum go dobutal, e da
> ima slednite obekti
>
>
> *************************************************************
>
> struct trans;
> struct state;
>
> struct gfa {
>   struct state *states; // Head of the list of states
>   struct state *start; // Head of the list of starting states
>   struct state *final; // Head of the list of final states
>   pool_t state_pool; // Pool from which the states are allocated
>   pool_t trans_pool; // Pool from which the transitions are allocated
>   size_t state_nr;   // Number of states - used for assigning next state id
>   // --- Some overridable methods for managing transitions
> ----------------- insert_func_t *insert; // Transition inserting function
>   remove_func_t *remove; // Transition removing function
>   search_func_t *search; // Transition searching function
>
> };
>
> struct state {
>   struct trans *incoming; // List of incoming transitions
>   struct trans *outgoing; // List of outgoing transitions
>   struct state *start; // Link in list of start states (NULL if non-start)
>   struct state *final; // Link in list of final states (NULL if non-final)
>   struct state *next;  // Link in list of all states
>   struct gfa *parent; // The automaton this state is part of
>   size_t id; // Id for dumping and accessing purposes
>   // More stuff?...
> };
>
> struct trans {
>   struct state *src; // Where from
>   struct state *dst; // Where to
>   struct trans *src_next; // Link in the list of transitions for src
>   struct trans *dst_next; // Link in the list of transitions for dst
>   // Intentionally no symbol -- this is an abstract transition
> };
>
> // --- Example: NFA transition
>
> struct nfa_trans {
>   struct trans base; // Should be first for lists and casts to work
>   char alpha;
> };
>
>
> *************************************************************
>
>
>
> Neshto ej takova.. Puk posle kato se initializira konkreten avtomat shte se
> podava size-a na alphabet symbola i taka shte se inicializira trans_pool.
> Sushto shte se podavat i konkretni funkcii za insert/remove/search na
> transition, koito obshto vzeto shte vzimat src_state, symbol, dst_state i
> shte pravjat kakvoto tam se nalaga.
>
> Tuk veche idva vuprosa za efektivnostta. Mozhe da vi pravi vpechatlenie che
> baja pamet shte jade tova zhivotno, obache puk shte ima vsichki neobhodimi
> vruzki, koeto se nadjavam da ulesni algoritmite posle.
>
> Stoi sushto vuprosa kak shte sa podredeni transitionite za daden state. Za
> momenta shte e dummy list bez nikakva naredba, obache se seshtate che tova
> ni kachva slozhnostta na izpulnenie na avtomat vurhu dadena duma.
> Tova e edna ot prichinite da zabija insert/remove/search operaciite kato
> function pointers - edin vid vseki konkreten avtomat shte si reshava kak da
> gi redi, i tursi. Mozhe za momenta da gi ostavim po tozi nachin puk v
> budeshte ako se poluchi mnogo tezhko naistina da mislim kak da se
> optimizira. Obshto vzeto ima megdan.
>
>
> Ta tova e obshto vzeto predlozhenieto za sega. Kakvo mislite?
> Mozhe da obsudim na zhivo Pesho kato si vzeme durzhavnija s otlichie, i bez
> tova shte trjabva da cherpi ne edna i dve biri po povoda :)
>
>
> Ajde do kukane i pishete ako neshto
>
>
>
> -------------------------------------------------------
> SF.Net email is sponsored by:
> Tame your development challenges with Apache's Geronimo App Server.
> Download it for free - -and be entered to win a 42" plasma tv or your very
> own Sony(tm)PSP.  Click here to play: http://sourceforge.net/geronimo.php
> _______________________________________________
> Libfsd-devel mailing list
> Lib...@li...
> https://lists.sourceforge.net/lists/listinfo/libfsd-devel

"Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
 annotations on 09/19/05 05:46:51
------------------------------------------------------------------------------
This e-mail, including attachments, may include confidential and/or proprietary information, and may be used only by the person or entity to which it is addressed.  If the reader of this e-mail is not the intended recipient or his or her authorized agent, the reader is hereby notified that any dissemination, distribution or copying of this e-mail is prohibited. If you have received this e-mail in error, please notify the sender by replying to this message and delete this e-mail immediately.
==============================================================================

[Libfsd-devel] Tva-onova

[Ivan P. <va...@ne...>]

Privet!

Za da ne zamira "proekta" (:]) dokato Pesho go trese predpizpitna treska 
(uspeh, Pesho!), eto kakvo e polozhenieto i kakvi vuprosi me zanimavat.

Znachi do tuk imam implementnat parser-a na reguljarni izrazi, kojto e pochti 
POSIX-compatible (ostavat mnogo malko featuri da se dobavjat, ama za sega me 
murzi, puk i te sa njakvi dosta nenuzhni - nikoga ne bjah chuval za collating 
sequences i equivallence classes v reguljarni izrazi predi da procheta 
spesifikacijata). Taka che za momenta tozi parser shte svurshi rabota. 
Edinstveno ostavat da se napravjat testove i malko da se pozagladjat njakoi 
rubove :).

Mislja che ottuk mozhem da zapochnem da pravim avtomatite. Struva mi se 
naj-dobre da zapochnem s njakakuv vid general avtomati (GFA - General Finite 
Automaton), kojto da e abstrakten i da njama azbuka. Tuk idva purvijat 
vupros. Izglezhda edinstvenoto, koeto razlichava vsichki vidove avtomati i 
transduceri za koito se seshtam e azbukata. Primerno za NFA tova shte sa 
njakakvi simvoli, a za transducerite azbukata sa dvojki ot naj-obshto simvol 
i output string. Toest trjabva tozi GFA da se napravi taka che sled tova da 
mozhe s neshto kato konfiguracija da se napravi proizvolen drug avtomat. 
Za momenta varianta, do kojto sum go dobutal, e da ima slednite obekti


*************************************************************

struct trans;
struct state;

struct gfa {
  struct state *states; // Head of the list of states
  struct state *start; // Head of the list of starting states
  struct state *final; // Head of the list of final states
  pool_t state_pool; // Pool from which the states are allocated
  pool_t trans_pool; // Pool from which the transitions are allocated
  size_t state_nr;   // Number of states - used for assigning next state id
  // --- Some overridable methods for managing transitions -----------------
  insert_func_t *insert; // Transition inserting function
  remove_func_t *remove; // Transition removing function 
  search_func_t *search; // Transition searching function
  
};

struct state {
  struct trans *incoming; // List of incoming transitions
  struct trans *outgoing; // List of outgoing transitions
  struct state *start; // Link in list of start states (NULL if non-start)
  struct state *final; // Link in list of final states (NULL if non-final)
  struct state *next;  // Link in list of all states 
  struct gfa *parent; // The automaton this state is part of 
  size_t id; // Id for dumping and accessing purposes
  // More stuff?...
};

struct trans {
  struct state *src; // Where from 
  struct state *dst; // Where to
  struct trans *src_next; // Link in the list of transitions for src
  struct trans *dst_next; // Link in the list of transitions for dst
  // Intentionally no symbol -- this is an abstract transition 
};

// --- Example: NFA transition

struct nfa_trans {
  struct trans base; // Should be first for lists and casts to work
  char alpha;
};


*************************************************************



Neshto ej takova.. Puk posle kato se initializira konkreten avtomat shte se 
podava size-a na alphabet symbola i taka shte se inicializira trans_pool. 
Sushto shte se podavat i konkretni funkcii za insert/remove/search na 
transition, koito obshto vzeto shte vzimat src_state, symbol, dst_state i 
shte pravjat kakvoto tam se nalaga.

Tuk veche idva vuprosa za efektivnostta. Mozhe da vi pravi vpechatlenie che 
baja pamet shte jade tova zhivotno, obache puk shte ima vsichki neobhodimi 
vruzki, koeto se nadjavam da ulesni algoritmite posle.

Stoi sushto vuprosa kak shte sa podredeni transitionite za daden state. Za 
momenta shte e dummy list bez nikakva naredba, obache se seshtate che tova ni 
kachva slozhnostta na izpulnenie na avtomat vurhu dadena duma. 
Tova e edna ot prichinite da zabija insert/remove/search operaciite kato 
function pointers - edin vid vseki konkreten avtomat shte si reshava kak da 
gi redi, i tursi. Mozhe za momenta da gi ostavim po tozi nachin puk v 
budeshte ako se poluchi mnogo tezhko naistina da mislim kak da se optimizira. 
Obshto vzeto ima megdan.


Ta tova e obshto vzeto predlozhenieto za sega. Kakvo mislite?
Mozhe da obsudim na zhivo Pesho kato si vzeme durzhavnija s otlichie, i bez 
tova shte trjabva da cherpi ne edna i dve biri po povoda :)


Ajde do kukane i pishete ako neshto

Re: [Libfsd-devel] Hello World!

[Ivan P. <va...@ne...>]

na domashnija mi ljubimec edinstveno i samo. 
chakam da mi pusnat net vkushti i shte go slozha v CVS-a, kojto sourceforge ni 
davat

On Monday 12 September 2005 19:14, you wrote:
> Da, ako moje sled 19ti, kato mi mine dyrjavniq ... btw kyde moje da se
> nameri tova deto kazvash, che si go napravil?
>
> On 9/7/05, Ivan Peikov <va...@ne...> wrote:
> > Ok, mozhe bi naj-dobre e da napravim sbirka i da obsudim nazhivo kakvo
> > shte
> > pravim. Pishete do lib...@li... (mailing list-a).
> > Za sega sme samo az, Zhoro i Pesho ama hubavoto e che postingite se
> > arhivirat i
> > shte mozhem da chetem posle njakakvi neshta koito sa se obsuzhdali
> >
> > On Wednesday 07 September 2005 11:36, Georgi Mungov wrote:
> > > On Wednesday 07 September 2005 11:23, Ivan Peikov wrote:
> > > > Privet!
> > > >
> > > > Tova e libfsd-devel mailing list-a za razni neshta okolo libfsd
> > > > (Finite-state devices library).
> > > > Napravih regular expression parser-a i sega go dopulvam (gonja POSIX
> > > > compatibility). Neshtata koito predstojat sa (v tozi red)
> >
> > implementacija
> >
> > > > na NFA, DFA, FST (finite-state transducer) i BIM (bimachine) moduli.
> >
> > REX
> >
> > > > parser-a stana ultra burz i se nadjavam da si ostane takuv dori sled
> >
> > kato
> >
> > > > stane napulno POSIX-compatible. Kato che li naj-osnovnija problem
> >
> > kojto
> >
> > > > sedi v momenta e implementacijata na graph i vsichki algoritmi okolo
> > > > nego, ponezhe toj shte stoi v osnovata na vsichki drugi moduli.
> >
> > Trjabva
> >
> > > > taka da go izmislim, che sled tova vsjaka nova abstraktna mashina da
> >
> > go
> >
> > > > izpolzva bez da se nalaga da go prepravjame.
> > >
> > > seshtam se che v NC biah gledal edin broi na DDJ s niakva biblioteka za
> > > graphs -- mislia che beshe na Java, mai beshe ot 2001, 2002. Ama kato
> > > se zamisliam moje i na C++ da e bila zashtoto imam niakvi spomeni za
> >
> > templates
> >
> > > > Drugo neshto, koeto si misleh che njama da e zle v dalechno budeshte
> > > > e bindings kum naj-izpolzvanite ezici kato Perl (XS), Java (JNI), C++
> > > > (native) i drugi (Python?).
> > >
> > > specialno za Java moje i da ne e nai dobria variant
> > >
> > > > Ponezhe kato cjalo operaciite vurhu tezi mashini sa tezhki
> > > > (determinizacija) vizhdal sum che mnogo se praktikuva kompiliraneto
> > > > im
> >
> > do
> >
> > > > binary i sled tova zarezhdaneto ot file. Trjabva da se izmisljat
> >
> > njakakvi
> >
> > > > obshti interface-i za serializacija/deserializacija.
> > >
> > > Tova s compile to binary naistina e taka i sledvashtata stupka e da
> >
> > mojesh
> >
> > > da pravish diff/patch na edin avtomat koito e compiled za da go
> > > modificirash.
> > >
> > > > Ponezhe vsichki tezi mashini za vsushtnost bazirani na graphi,
> >
> > napravil
> >
> > > > sum edin pool object, na kojto rabotata mu e da si alokira pamet na
> > > > po-golemi chunkove i da razdava po-malki fixed-sized chunkove ot tam.
> > > > Taka alokiraneto i free-vaneto na node-ove njama da fragmentira.
> > > > Specialno v REX izpolzvaneto na takuv pool dosta optimizira
> >
> > kompilacijata
> >
> > > > na reguljaren izraz.
> > > >
> > > > Ami eto tova e obshto vzeto nahvurjano kakvoto se seshtam v momenta.
> > > > Pishete dali vi interesuva i ako se seshtate oshte neshto.
> > >
> > > bira?
> > >
> > > > Pozdravi,
> > > > Ivan
> > > >
> > > >
> > > >
> > > > -------------------------------------------------------
> > > > SF.Net email is Sponsored by the Better Software Conference & EXPO
> > > > September 19-22, 2005 * San Francisco, CA * Development Lifecycle
> > > > Practices Agile & Plan-Driven Development * Managing Projects & Teams
> >
> > *
> >
> > > > Testing & QA Security * Process Improvement & Measurement *
> > > > http://www.sqe.com/bsce5sf
> > > > _______________________________________________
> > > > Libfsd-devel mailing list
> > > > Lib...@li...
> > > > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
> > >
> > > "Tumbleweed E-mail Firewall <tumbleweed.com <http://tumbleweed.com>>"
> >
> > made the following
> >
> > > annotations on 09/07/05 01:43:14
> >
> > -------------------------------------------------------------------------
> >--
> >
> > >--- This e-mail, including attachments, may include confidential and/or
> > > proprietary information, and may be used only by the person or entity
> > > to which it is addressed. If the reader of this e-mail is not the
> > > intended recipient or his or her authorized agent, the reader is hereby
> > > notified that any dissemination, distribution or copying of this e-mail
> > > is prohibited. If you have received this e-mail in error, please notify
> > > the sender by replying to this message and delete this e-mail
> > > immediately.
> >
> > =========================================================================
> >==
> >
> > >===
> >
> > -------------------------------------------------------
> > SF.Net email is Sponsored by the Better Software Conference & EXPO
> > September 19-22, 2005 * San Francisco, CA * Development Lifecycle
> > Practices
> > Agile & Plan-Driven Development * Managing Projects & Teams * Testing &
> > QA Security * Process Improvement & Measurement *
> > http://www.sqe.com/bsce5sf
> > _______________________________________________
> > Libfsd-devel mailing list
> > Lib...@li...
> > https://lists.sourceforge.net/lists/listinfo/libfsd-devel

Fwd: [Libfsd-devel] Hello World!

[Petar P. <pes...@gm...>]

---------- Forwarded message ----------
From: Petar Petrov <pes...@gm...>
Date: Sep 12, 2005 7:14 PM
Subject: Re: [Libfsd-devel] Hello World!
To: va...@ne...

Da, ako moje sled 19ti, kato mi mine dyrjavniq ... btw kyde moje da se=20
nameri tova deto kazvash, che si go napravil?=20

On 9/7/05, Ivan Peikov <va...@ne...> wrote:=20
>=20
> Ok, mozhe bi naj-dobre e da napravim sbirka i da obsudim nazhivo kakvo=20
> shte
> pravim. Pishete do lib...@li... (mailing list-a). Z=
a
> sega sme samo az, Zhoro i Pesho ama hubavoto e che postingite se arhivira=
t=20
> i
> shte mozhem da chetem posle njakakvi neshta koito sa se obsuzhdali
>=20
> On Wednesday 07 September 2005 11:36, Georgi Mungov wrote:=20
> > On Wednesday 07 September 2005 11:23, Ivan Peikov wrote:
> > > Privet!
> > >
> > > Tova e libfsd-devel mailing list-a za razni neshta okolo libfsd
> > > (Finite-state devices library).=20
> > > Napravih regular expression parser-a i sega go dopulvam (gonja POSIX
> > > compatibility). Neshtata koito predstojat sa (v tozi red)=20
> implementacija
> > > na NFA, DFA, FST (finite-state transducer) i BIM (bimachine) moduli.=
=20
> REX=20
> > > parser-a stana ultra burz i se nadjavam da si ostane takuv dori sled=
=20
> kato
> > > stane napulno POSIX-compatible. Kato che li naj-osnovnija problem=20
> kojto
> > > sedi v momenta e implementacijata na graph i vsichki algoritmi okolo=
=20
> > > nego, ponezhe toj shte stoi v osnovata na vsichki drugi moduli.=20
> Trjabva
> > > taka da go izmislim, che sled tova vsjaka nova abstraktna mashina da=
=20
> go
> > > izpolzva bez da se nalaga da go prepravjame.=20
> >
> > seshtam se che v NC biah gledal edin broi na DDJ s niakva biblioteka za
> > graphs -- mislia che beshe na Java, mai beshe ot 2001, 2002. Ama kato s=
e
> > zamisliam moje i na C++ da e bila zashtoto imam niakvi spomeni za=20
> templates=20
> >
> > > Drugo neshto, koeto si misleh che njama da e zle v dalechno budeshte =
e
> > > bindings kum naj-izpolzvanite ezici kato Perl (XS), Java (JNI), C++
> > > (native) i drugi (Python?).
> >=20
> > specialno za Java moje i da ne e nai dobria variant
> >
> > > Ponezhe kato cjalo operaciite vurhu tezi mashini sa tezhki
> > > (determinizacija) vizhdal sum che mnogo se praktikuva kompiliraneto i=
m=20
> do=20
> > > binary i sled tova zarezhdaneto ot file. Trjabva da se izmisljat=20
> njakakvi
> > > obshti interface-i za serializacija/deserializacija.
> >
> > Tova s compile to binary naistina e taka i sledvashtata stupka e da=20
> mojesh=20
> > da pravish diff/patch na edin avtomat koito e compiled za da go
> > modificirash.
> >
> > > Ponezhe vsichki tezi mashini za vsushtnost bazirani na graphi,=20
> napravil
> > > sum edin pool object, na kojto rabotata mu e da si alokira pamet na=
=20
> > > po-golemi chunkove i da razdava po-malki fixed-sized chunkove ot tam.
> > > Taka alokiraneto i free-vaneto na node-ove njama da fragmentira.
> > > Specialno v REX izpolzvaneto na takuv pool dosta optimizira=20
> kompilacijata=20
> > > na reguljaren izraz.
> > >
> > > Ami eto tova e obshto vzeto nahvurjano kakvoto se seshtam v momenta.
> > > Pishete dali vi interesuva i ako se seshtate oshte neshto.
> >
> > bira?=20
> >
> > > Pozdravi,
> > > Ivan
> > >
> > >
> > >
> > > -------------------------------------------------------
> > > SF.Net email is Sponsored by the Better Software Conference & EXPO=20
> > > September 19-22, 2005 * San Francisco, CA * Development Lifecycle
> > > Practices Agile & Plan-Driven Development * Managing Projects & Teams=
=20
> *
> > > Testing & QA Security * Process Improvement & Measurement *=20
> > > http://www.sqe.com/bsce5sf
> > > _______________________________________________
> > > Libfsd-devel mailing list
> > > Lib...@li...
> > > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
> >
> > "Tumbleweed E-mail Firewall < tumbleweed.com <http://tumbleweed.com/>>"=
=20
> made the following
> > annotations on 09/07/05 01:43:14
> >=20
> -------------------------------------------------------------------------=
--
> >--- This e-mail, including attachments, may include confidential and/or=
=20
> > proprietary information, and may be used only by the person or entity t=
o
> > which it is addressed. If the reader of this e-mail is not the intended
> > recipient or his or her authorized agent, the reader is hereby notified=
=20
> > that any dissemination, distribution or copying of this e-mail is
> > prohibited. If you have received this e-mail in error, please notify th=
e
> > sender by replying to this message and delete this e-mail immediately.=
=20
> >=20
> =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D
> >=3D=3D=3D
>=20
>=20
>=20
> -------------------------------------------------------
> SF.Net email is Sponsored by the Better Software Conference & EXPO=20
> September 19-22, 2005 * San Francisco, CA * Development Lifecycle=20
> Practices
> Agile & Plan-Driven Development * Managing Projects & Teams * Testing & Q=
A
> Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf
> _______________________________________________
> Libfsd-devel mailing list
> Lib...@li...=20
> https://lists.sourceforge.net/lists/listinfo/libfsd-devel
>

Re: [Libfsd-devel] Hello World!

[Ivan P. <va...@ne...>]

Ok, mozhe bi naj-dobre e da napravim sbirka i da obsudim nazhivo kakvo shte 
pravim. Pishete do lib...@li... (mailing list-a). Za 
sega sme samo az, Zhoro i Pesho ama hubavoto e che postingite se arhivirat i 
shte mozhem da chetem posle njakakvi neshta koito sa se obsuzhdali

On Wednesday 07 September 2005 11:36, Georgi Mungov wrote:
> On Wednesday 07 September 2005 11:23, Ivan Peikov wrote:
> > Privet!
> >
> > Tova e libfsd-devel mailing list-a za razni neshta okolo libfsd
> > (Finite-state devices library).
> > Napravih regular expression parser-a i sega go dopulvam (gonja POSIX
> > compatibility). Neshtata koito predstojat sa (v tozi red) implementacija
> > na NFA, DFA, FST (finite-state transducer) i BIM (bimachine) moduli. REX
> > parser-a stana ultra burz i se nadjavam da si ostane takuv dori sled kato
> > stane napulno POSIX-compatible. Kato che li naj-osnovnija problem kojto
> > sedi v momenta e implementacijata na graph i vsichki algoritmi okolo
> > nego, ponezhe toj shte stoi v osnovata na vsichki drugi moduli. Trjabva
> > taka da go izmislim, che sled tova vsjaka nova abstraktna mashina da go
> > izpolzva bez da se nalaga da go prepravjame.
>
> seshtam se che v NC biah gledal edin broi na DDJ s niakva biblioteka za
> graphs -- mislia che beshe na Java, mai beshe ot 2001, 2002. Ama kato se
> zamisliam moje i na C++ da e bila zashtoto imam niakvi spomeni za templates
>
> > Drugo neshto, koeto si misleh che njama da e zle v dalechno budeshte e
> > bindings kum naj-izpolzvanite ezici kato Perl (XS), Java (JNI), C++
> > (native) i drugi (Python?).
>
> specialno za Java moje i da ne e nai dobria variant
>
> > Ponezhe kato cjalo operaciite vurhu tezi mashini sa tezhki
> > (determinizacija) vizhdal sum che mnogo se praktikuva kompiliraneto im do
> > binary i sled tova zarezhdaneto ot file. Trjabva da se izmisljat njakakvi
> > obshti interface-i za serializacija/deserializacija.
>
> Tova s compile to binary naistina e taka i sledvashtata stupka e da mojesh
> da pravish diff/patch na edin avtomat koito e compiled za da go
> modificirash.
>
> > Ponezhe vsichki tezi mashini za vsushtnost bazirani na graphi, napravil
> > sum edin pool object, na kojto rabotata mu e da si alokira pamet na
> > po-golemi chunkove i da razdava po-malki fixed-sized chunkove ot tam.
> > Taka alokiraneto i free-vaneto na node-ove njama da fragmentira.
> > Specialno v REX izpolzvaneto na takuv pool dosta optimizira kompilacijata
> > na reguljaren izraz.
> >
> > Ami eto tova e obshto vzeto nahvurjano kakvoto se seshtam v momenta.
> > Pishete dali vi interesuva i ako se seshtate oshte neshto.
>
> bira?
>
> > Pozdravi,
> > Ivan
> >
> >
> >
> > -------------------------------------------------------
> > SF.Net email is Sponsored by the Better Software Conference & EXPO
> > September 19-22, 2005 * San Francisco, CA * Development Lifecycle
> > Practices Agile & Plan-Driven Development * Managing Projects & Teams *
> > Testing & QA Security * Process Improvement & Measurement *
> > http://www.sqe.com/bsce5sf
> > _______________________________________________
> > Libfsd-devel mailing list
> > Lib...@li...
> > https://lists.sourceforge.net/lists/listinfo/libfsd-devel
>
> "Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
>  annotations on 09/07/05 01:43:14
> ---------------------------------------------------------------------------
>--- This e-mail, including attachments, may include confidential and/or
> proprietary information, and may be used only by the person or entity to
> which it is addressed.  If the reader of this e-mail is not the intended
> recipient or his or her authorized agent, the reader is hereby notified
> that any dissemination, distribution or copying of this e-mail is
> prohibited. If you have received this e-mail in error, please notify the
> sender by replying to this message and delete this e-mail immediately.
> ===========================================================================
>===

Re: [Libfsd-devel] Hello World!

[Georgi M. <geo...@tu...>]

On Wednesday 07 September 2005 11:23, Ivan Peikov wrote:
> Privet!
>
> Tova e libfsd-devel mailing list-a za razni neshta okolo libfsd
> (Finite-state devices library).
> Napravih regular expression parser-a i sega go dopulvam (gonja POSIX
> compatibility). Neshtata koito predstojat sa (v tozi red) implementacija na
> NFA, DFA, FST (finite-state transducer) i BIM (bimachine) moduli. REX
> parser-a stana ultra burz i se nadjavam da si ostane takuv dori sled kato
> stane napulno POSIX-compatible. Kato che li naj-osnovnija problem kojto
> sedi v momenta e implementacijata na graph i vsichki algoritmi okolo nego,
> ponezhe toj shte stoi v osnovata na vsichki drugi moduli. Trjabva taka da
> go izmislim, che sled tova vsjaka nova abstraktna mashina da go izpolzva
> bez da se nalaga da go prepravjame.

seshtam se che v NC biah gledal edin broi na DDJ s niakva biblioteka za graphs 
-- mislia che beshe na Java, mai beshe ot 2001, 2002. Ama kato se zamisliam 
moje i na C++ da e bila zashtoto imam niakvi spomeni za templates

> Drugo neshto, koeto si misleh che njama da e zle v dalechno budeshte e
> bindings kum naj-izpolzvanite ezici kato Perl (XS), Java (JNI), C++
> (native) i drugi (Python?).

specialno za Java moje i da ne e nai dobria variant 

> Ponezhe kato cjalo operaciite vurhu tezi mashini sa tezhki
> (determinizacija) vizhdal sum che mnogo se praktikuva kompiliraneto im do
> binary i sled tova zarezhdaneto ot file. Trjabva da se izmisljat njakakvi
> obshti interface-i za serializacija/deserializacija.

Tova s compile to binary naistina e taka i sledvashtata stupka e da mojesh da 
pravish diff/patch na edin avtomat koito e compiled za da go modificirash. 

> Ponezhe vsichki tezi mashini za vsushtnost bazirani na graphi, napravil sum
> edin pool object, na kojto rabotata mu e da si alokira pamet na po-golemi
> chunkove i da razdava po-malki fixed-sized chunkove ot tam. Taka
> alokiraneto i free-vaneto na node-ove njama da fragmentira. Specialno v REX
> izpolzvaneto na takuv pool dosta optimizira kompilacijata na reguljaren
> izraz.
>
> Ami eto tova e obshto vzeto nahvurjano kakvoto se seshtam v momenta.
> Pishete dali vi interesuva i ako se seshtate oshte neshto.
>

bira?
>
> Pozdravi,
> Ivan
>
>
>
> -------------------------------------------------------
> SF.Net email is Sponsored by the Better Software Conference & EXPO
> September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices
> Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA
> Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf
> _______________________________________________
> Libfsd-devel mailing list
> Lib...@li...
> https://lists.sourceforge.net/lists/listinfo/libfsd-devel

"Tumbleweed E-mail Firewall <tumbleweed.com>" made the following
 annotations on 09/07/05 01:46:40
------------------------------------------------------------------------------
This e-mail, including attachments, may include confidential and/or proprietary information, and may be used only by the person or entity to which it is addressed.  If the reader of this e-mail is not the intended recipient or his or her authorized agent, the reader is hereby notified that any dissemination, distribution or copying of this e-mail is prohibited. If you have received this e-mail in error, please notify the sender by replying to this message and delete this e-mail immediately.
==============================================================================

[Libfsd-devel] Hello World! (again)

[Ivan P. <va...@ne...>]

Privet!

Tova e libfsd-devel mailing list-a za razni neshta okolo libfsd (Finite-state 
devices library). 
Napravih regular expression parser-a i sega go dopulvam (gonja POSIX 
compatibility). Neshtata koito predstojat sa (v tozi red) implementacija na 
NFA, DFA, FST (finite-state transducer) i BIM (bimachine) moduli. REX 
parser-a stana ultra burz i se nadjavam da si ostane takuv dori sled kato 
stane napulno POSIX-compatible. Kato che li naj-osnovnija problem kojto sedi 
v momenta e implementacijata na graph i vsichki algoritmi okolo nego, ponezhe 
toj shte stoi v osnovata na vsichki drugi moduli. Trjabva taka da go 
izmislim, che sled tova vsjaka nova abstraktna mashina da go izpolzva bez da 
se nalaga da go prepravjame.
Drugo neshto, koeto si misleh che njama da e zle v dalechno budeshte e 
bindings kum naj-izpolzvanite ezici kato Perl (XS), Java (JNI), C++ (native) 
i drugi (Python?). 
Ponezhe kato cjalo operaciite vurhu tezi mashini sa tezhki (determinizacija) 
vizhdal sum che mnogo se praktikuva kompiliraneto im do binary i sled tova 
zarezhdaneto ot file. Trjabva da se izmisljat njakakvi obshti interface-i za 
serializacija/deserializacija. 
Ponezhe vsichki tezi mashini za vsushtnost bazirani na graphi, napravil sum 
edin pool object, na kojto rabotata mu e da si alokira pamet na po-golemi 
chunkove i da razdava po-malki fixed-sized chunkove ot tam. Taka alokiraneto 
i free-vaneto na node-ove njama da fragmentira. Specialno v REX izpolzvaneto 
na takuv pool dosta optimizira kompilacijata na reguljaren izraz. 

Ami eto tova e obshto vzeto nahvurjano kakvoto se seshtam v momenta. Pishete 
dali vi interesuva i ako se seshtate oshte neshto. 


Pozdravi,
Ivan

[Libfsd-devel] Hello World!

[Ivan P. <va...@ne...>]

Privet!

Tova e libfsd-devel mailing list-a za razni neshta okolo libfsd (Finite-state 
devices library). 
Napravih regular expression parser-a i sega go dopulvam (gonja POSIX 
compatibility). Neshtata koito predstojat sa (v tozi red) implementacija na 
NFA, DFA, FST (finite-state transducer) i BIM (bimachine) moduli. REX 
parser-a stana ultra burz i se nadjavam da si ostane takuv dori sled kato 
stane napulno POSIX-compatible. Kato che li naj-osnovnija problem kojto sedi 
v momenta e implementacijata na graph i vsichki algoritmi okolo nego, ponezhe 
toj shte stoi v osnovata na vsichki drugi moduli. Trjabva taka da go 
izmislim, che sled tova vsjaka nova abstraktna mashina da go izpolzva bez da 
se nalaga da go prepravjame.
Drugo neshto, koeto si misleh che njama da e zle v dalechno budeshte e 
bindings kum naj-izpolzvanite ezici kato Perl (XS), Java (JNI), C++ (native) 
i drugi (Python?). 
Ponezhe kato cjalo operaciite vurhu tezi mashini sa tezhki (determinizacija) 
vizhdal sum che mnogo se praktikuva kompiliraneto im do binary i sled tova 
zarezhdaneto ot file. Trjabva da se izmisljat njakakvi obshti interface-i za 
serializacija/deserializacija. 
Ponezhe vsichki tezi mashini za vsushtnost bazirani na graphi, napravil sum 
edin pool object, na kojto rabotata mu e da si alokira pamet na po-golemi 
chunkove i da razdava po-malki fixed-sized chunkove ot tam. Taka alokiraneto 
i free-vaneto na node-ove njama da fragmentira. Specialno v REX izpolzvaneto 
na takuv pool dosta optimizira kompilacijata na reguljaren izraz. 

Ami eto tova e obshto vzeto nahvurjano kakvoto se seshtam v momenta. Pishete 
dali vi interesuva i ako se seshtate oshte neshto. 


Pozdravi,
Ivan