File: call_infix.e

package info (click to toggle)
smarteiffel 1.1-11
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 12,288 kB
  • ctags: 40,785
  • sloc: ansic: 35,791; lisp: 4,036; sh: 1,783; java: 895; ruby: 613; python: 209; makefile: 115; csh: 78; cpp: 50
file content (179 lines) | stat: -rw-r--r-- 5,000 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
-- This file is part of SmartEiffel The GNU Eiffel Compiler Tools and Libraries
--
-- SmartEiffel is  free software;  you can redistribute it and/or  modify it
-- under  the terms of the  GNU General Public License, as published by  the
-- Free Software Foundation; either version 2, or (at your option) any later
-- version.
-- SmartEiffel is distributed in the hope that it will be useful but WITHOUT 
-- ANY WARRANTY;  without  even the implied warranty  of MERCHANTABILITY  or
-- FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
-- more details.  You should have received a copy of  the GNU General Public
-- License along with SmartEiffel;  see the file COPYING.  If not,  write to
-- the Free Software Foundation,  Inc., 59 Temple Place - Suite 330,  Boston, 
-- MA 02111-1307, USA.
--
-- Copyright(C) 1994-2002: INRIA - LORIA (INRIA Lorraine) - ESIAL U.H.P.
--			   - University of Nancy 1 - FRANCE
-- Copyright(C) 2003:      INRIA - LORIA (INRIA Lorraine) - I.U.T. Charlemagne
--			   - University of Nancy 2 - FRANCE
--
--		 Dominique COLNET, Suzanne COLLIN, Olivier ZENDRA,
--			   Philippe RIBET, Cyril ADRIAN
--
-- http://SmartEiffel.loria.fr - SmartEiffel@loria.fr
--
deferred class CALL_INFIX
   --
   -- For all sort of infix operators (root of all CALL_INFIX_*).
   --

inherit CALL_1 redefine print_as_target end

feature

   extra_bracket_flag: BOOLEAN is True

   left_brackets: BOOLEAN is
      deferred
      end

   right_brackets: BOOLEAN is
      do
         Result := not left_brackets
      end

   operator: STRING is
      deferred
      ensure
         Result.count >= 1
      end

   frozen simplify_2: EXPRESSION is
      do
	 target := target.simplify_2
	 arguments.simplify_2
	 Result := simplify_1_
      end
   
   frozen short is
      do
         if target.precedence = atomic_precedence then
            target.short
         elseif precedence > target.precedence then
            target.bracketed_short
         elseif precedence < target.precedence then
            target.short
         elseif left_brackets then
            target.bracketed_short
         else
            target.short
         end
         short_print_feature_name
         if arg1.precedence = atomic_precedence then
            arg1.short
         elseif precedence > arg1.precedence then
            arg1.bracketed_short
         elseif precedence < arg1.precedence then
            arg1.short
         elseif right_brackets then
            arg1.bracketed_short
         else
            arg1.short
         end
      end

   frozen short_target is
      do
         bracketed_short
         short_print.a_dot
      end

   frozen print_as_target is
      do
         pretty_printer.put_character('(')
         pretty_print
         pretty_printer.put_character(')')
         pretty_printer.put_character('.')
      end

   frozen bracketed_pretty_print is
      do
         pretty_printer.put_character('(')
         pretty_print
         pretty_printer.put_character(')')
      end
   
   frozen pretty_print is
      do
	 -- The `target' first:
         if target.precedence = atomic_precedence then
            target.pretty_print
         elseif precedence > target.precedence then
            target.bracketed_pretty_print
         elseif precedence < target.precedence then
            target.pretty_print
         elseif left_brackets then
            target.bracketed_pretty_print
         else
            target.pretty_print
         end
	 -- The operator:
	 pretty_printer.put_character(' ')
         feature_name.pretty_print
	 pretty_printer.put_character(' ')
	 -- The argument, `arg1':
         if arg1.precedence = atomic_precedence then
            arg1.pretty_print
         elseif precedence > arg1.precedence then
            arg1.bracketed_pretty_print
         elseif precedence < arg1.precedence then
            arg1.pretty_print
         elseif right_brackets then
            arg1.bracketed_pretty_print
         else
            arg1.pretty_print
         end
      end

feature {CALL_INFIX_VISITOR}

   accept(visitor: CALL_INFIX_VISITOR) is
      deferred
      end

feature {NONE}

   frozen short_print_feature_name is
      do
         short_print.a_infix_name("Binfix"," ","Ainfix"," ",feature_name)
      end

   frozen c2c_cast_op(cast, op: STRING) is
      do
         cpp.put_character('(')
         cpp.put_character('(')
         cpp.put_character('(')
         cpp.put_string(cast)
         cpp.put_character(')')
         cpp.put_character('(')
         target.compile_to_c
         cpp.put_character(')')
         cpp.put_character(')')
         cpp.put_string(op)
         cpp.put_character('(')
         cpp.put_character('(')
         cpp.put_string(cast)
         cpp.put_character(')')
         cpp.put_character('(')
         arg1.compile_to_c
         cpp.put_character(')')
         cpp.put_character(')')
         cpp.put_character(')')
      end

invariant

   feature_name.is_infix_name

end -- CALL_INFIX