1 |
281 |
jeremybenn |
------------------------------------------------------------------------------
|
2 |
|
|
-- --
|
3 |
|
|
-- GNAT COMPILER COMPONENTS --
|
4 |
|
|
-- --
|
5 |
|
|
-- S E M _ C H 4 --
|
6 |
|
|
-- --
|
7 |
|
|
-- S p e c --
|
8 |
|
|
-- --
|
9 |
|
|
-- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
|
10 |
|
|
-- --
|
11 |
|
|
-- GNAT is free software; you can redistribute it and/or modify it under --
|
12 |
|
|
-- terms of the GNU General Public License as published by the Free Soft- --
|
13 |
|
|
-- ware Foundation; either version 3, or (at your option) any later ver- --
|
14 |
|
|
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
|
15 |
|
|
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
|
16 |
|
|
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
|
17 |
|
|
-- for more details. You should have received a copy of the GNU General --
|
18 |
|
|
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
|
19 |
|
|
-- http://www.gnu.org/licenses for a complete copy of the license. --
|
20 |
|
|
-- --
|
21 |
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
22 |
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
23 |
|
|
-- --
|
24 |
|
|
------------------------------------------------------------------------------
|
25 |
|
|
|
26 |
|
|
with Types; use Types;
|
27 |
|
|
|
28 |
|
|
package Sem_Ch4 is
|
29 |
|
|
procedure Analyze_Aggregate (N : Node_Id);
|
30 |
|
|
procedure Analyze_Allocator (N : Node_Id);
|
31 |
|
|
procedure Analyze_Arithmetic_Op (N : Node_Id);
|
32 |
|
|
procedure Analyze_Call (N : Node_Id);
|
33 |
|
|
procedure Analyze_Comparison_Op (N : Node_Id);
|
34 |
|
|
procedure Analyze_Concatenation (N : Node_Id);
|
35 |
|
|
procedure Analyze_Conditional_Expression (N : Node_Id);
|
36 |
|
|
procedure Analyze_Equality_Op (N : Node_Id);
|
37 |
|
|
procedure Analyze_Explicit_Dereference (N : Node_Id);
|
38 |
|
|
procedure Analyze_Logical_Op (N : Node_Id);
|
39 |
|
|
procedure Analyze_Membership_Op (N : Node_Id);
|
40 |
|
|
procedure Analyze_Negation (N : Node_Id);
|
41 |
|
|
procedure Analyze_Null (N : Node_Id);
|
42 |
|
|
procedure Analyze_Qualified_Expression (N : Node_Id);
|
43 |
|
|
procedure Analyze_Range (N : Node_Id);
|
44 |
|
|
procedure Analyze_Reference (N : Node_Id);
|
45 |
|
|
procedure Analyze_Selected_Component (N : Node_Id);
|
46 |
|
|
procedure Analyze_Short_Circuit (N : Node_Id);
|
47 |
|
|
procedure Analyze_Slice (N : Node_Id);
|
48 |
|
|
procedure Analyze_Type_Conversion (N : Node_Id);
|
49 |
|
|
procedure Analyze_Unary_Op (N : Node_Id);
|
50 |
|
|
procedure Analyze_Unchecked_Expression (N : Node_Id);
|
51 |
|
|
procedure Analyze_Unchecked_Type_Conversion (N : Node_Id);
|
52 |
|
|
|
53 |
|
|
procedure Analyze_Indexed_Component_Form (N : Node_Id);
|
54 |
|
|
-- Prior to semantic analysis, an indexed component node can denote any
|
55 |
|
|
-- of the following syntactic constructs:
|
56 |
|
|
-- a) An indexed component of an array
|
57 |
|
|
-- b) A function call
|
58 |
|
|
-- c) A conversion
|
59 |
|
|
-- d) A slice
|
60 |
|
|
-- The resolution of the construct requires some semantic information
|
61 |
|
|
-- on the prefix and the indices.
|
62 |
|
|
|
63 |
|
|
end Sem_Ch4;
|