TransitionDeclAST.py (9104:27d56b644e78) TransitionDeclAST.py (10165:7e9edf4297a9)
1# Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
2# Copyright (c) 2009 The Hewlett-Packard Development Company
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;

--- 15 unchanged lines hidden (view full) ---

24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28from slicc.ast.DeclAST import DeclAST
29from slicc.symbols import Transition
30
31class TransitionDeclAST(DeclAST):
1# Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
2# Copyright (c) 2009 The Hewlett-Packard Development Company
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;

--- 15 unchanged lines hidden (view full) ---

24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28from slicc.ast.DeclAST import DeclAST
29from slicc.symbols import Transition
30
31class TransitionDeclAST(DeclAST):
32 def __init__(self, slicc, request_types, states, events, next_state, pairs,
32 def __init__(self, slicc, request_types, states, events, next_state,
33 actions):
33 actions):
34 super(TransitionDeclAST, self).__init__(slicc, pairs)
34 super(TransitionDeclAST, self).__init__(slicc)
35
36 self.request_types = request_types
37 self.states = states
38 self.events = events
39 self.next_state = next_state
40 self.actions = actions
41
42 def __repr__(self):

--- 21 unchanged lines hidden (view full) ---

64 self.error("Invalid state: %s is not part of machine: %s" % \
65 (state, machine))
66 next_state = self.next_state or state
67 for event in self.events:
68 if event not in machine.events:
69 self.error("Invalid event: %s is not part of machine: %s" % \
70 (event, machine))
71 t = Transition(self.symtab, machine, state, event, next_state,
35
36 self.request_types = request_types
37 self.states = states
38 self.events = events
39 self.next_state = next_state
40 self.actions = actions
41
42 def __repr__(self):

--- 21 unchanged lines hidden (view full) ---

64 self.error("Invalid state: %s is not part of machine: %s" % \
65 (state, machine))
66 next_state = self.next_state or state
67 for event in self.events:
68 if event not in machine.events:
69 self.error("Invalid event: %s is not part of machine: %s" % \
70 (event, machine))
71 t = Transition(self.symtab, machine, state, event, next_state,
72 self.actions, self.request_types, self.location,
73 self.pairs)
72 self.actions, self.request_types, self.location)
74 machine.addTransition(t)
73 machine.addTransition(t)