factor/basis/regexp/transition-tables/transition-tables.factor

49 lines
1.4 KiB
Factor
Raw Normal View History

! Copyright (C) 2008 Doug Coleman.
! See http://factorcode.org/license.txt for BSD license.
USING: accessors arrays assocs fry hashtables kernel sequences
2009-02-18 13:27:07 -05:00
vectors ;
IN: regexp.transition-tables
TUPLE: transition from to obj ;
TUPLE: literal-transition < transition ;
TUPLE: class-transition < transition ;
TUPLE: default-transition < transition ;
TUPLE: literal obj ;
TUPLE: class obj ;
TUPLE: default ;
: make-transition ( from to obj class -- obj )
new
swap >>obj
swap >>to
swap >>from ;
: <literal-transition> ( from to obj -- transition )
literal-transition make-transition ;
2008-11-24 23:16:29 -05:00
: <class-transition> ( from to obj -- transition )
class-transition make-transition ;
2008-11-24 23:16:29 -05:00
: <default-transition> ( from to -- transition )
t default-transition make-transition ;
2008-11-24 23:16:29 -05:00
TUPLE: transition-table transitions start-state final-states ;
: <transition-table> ( -- transition-table )
transition-table new
H{ } clone >>transitions
2008-11-24 23:16:29 -05:00
H{ } clone >>final-states ;
2008-09-19 18:54:34 -04:00
: maybe-initialize-key ( key hashtable -- )
2009-01-23 19:20:47 -05:00
2dup key? [ 2drop ] [ [ H{ } clone ] 2dip set-at ] if ;
2008-09-19 18:54:34 -04:00
: set-transition ( transition hash -- )
2008-09-19 18:54:34 -04:00
#! set the state as a key
2dup [ to>> ] dip maybe-initialize-key
[ [ to>> ] [ obj>> ] [ from>> ] tri ] dip
2009-02-15 15:28:22 -05:00
2dup at* [ 2nip push-at ]
[ drop [ H{ } clone [ push-at ] keep ] 2dip set-at ] if ;
: add-transition ( transition transition-table -- )
transitions>> set-transition ;