1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
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. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Aspects; use Aspects;
27 with Atree; use Atree;
28 with Casing; use Casing;
29 with Debug; use Debug;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Fname; use Fname;
34 with Namet; use Namet;
35 with Nlists; use Nlists;
36 with Nmake; use Nmake;
38 with Output; use Output;
39 with Par_SCO; use Par_SCO;
40 with Scans; use Scans;
42 with Sinput; use Sinput;
43 with Sinput.L; use Sinput.L;
44 with Sinfo; use Sinfo;
45 with Snames; use Snames;
47 with Stylesw; use Stylesw;
49 with Tbuild; use Tbuild;
55 function Par (Configuration_Pragmas : Boolean) return List_Id is
57 Num_Library_Units : Natural := 0;
58 -- Count number of units parsed (relevant only in syntax check only mode,
59 -- since in semantics check mode only a single unit is permitted anyway)
61 Save_Config_Switches : Config_Switches_Type;
62 -- Variable used to save values of config switches while we parse the
63 -- new unit, to be restored on exit for proper recursive behavior.
65 Loop_Block_Count : Nat := 0;
66 -- Counter used for constructing loop/block names (see the routine
67 -- Par.Ch5.Get_Loop_Block_Name)
73 -- When an error is encountered, a call is made to one of the Error_Msg
74 -- routines to record the error. If the syntax scan is not derailed by the
75 -- error (e.g. a complaint that logical operators are inconsistent in an
76 -- EXPRESSION), then control returns from the Error_Msg call, and the
77 -- parse continues unimpeded.
79 -- If on the other hand, the Error_Msg represents a situation from which
80 -- the parser cannot recover locally, the exception Error_Resync is raised
81 -- immediately after the call to Error_Msg. Handlers for Error_Resync
82 -- are located at strategic points to resynchronize the parse. For example,
83 -- when an error occurs in a statement, the handler skips to the next
84 -- semicolon and continues the scan from there.
86 -- Each parsing procedure contains a note with the heading "Error recovery"
87 -- which shows if it can propagate the Error_Resync exception. In order
88 -- not to propagate the exception, a procedure must either contain its own
89 -- handler for this exception, or it must not call any other routines which
90 -- propagate the exception.
92 -- Note: the arrangement of Error_Resync handlers is such that it should
93 -- never be possible to transfer control through a procedure which made
94 -- an entry in the scope stack, invalidating the contents of the stack.
96 Error_Resync : exception;
97 -- Exception raised on error that is not handled locally, see above
99 Last_Resync_Point : Source_Ptr;
100 -- The resynchronization routines in Par.Sync run a risk of getting
101 -- stuck in an infinite loop if they do not skip a token, and the caller
102 -- keeps repeating the same resync call. On the other hand, if they skip
103 -- a token unconditionally, some recovery opportunities are missed. The
104 -- variable Last_Resync_Point records the token location previously set
105 -- by a Resync call, and if a subsequent Resync call occurs at the same
106 -- location, then the Resync routine does guarantee to skip a token.
108 --------------------------------------------
109 -- Handling Semicolon Used in Place of IS --
110 --------------------------------------------
112 -- The following global variables are used in handling the error situation
113 -- of using a semicolon in place of IS in a subprogram declaration as in:
115 -- procedure X (Y : Integer);
121 -- The two contexts in which this can appear are at the outer level, and
122 -- within a declarative region. At the outer level, we know something is
123 -- wrong as soon as we see the Q (or begin, if there are no declarations),
124 -- and we can immediately decide that the semicolon should have been IS.
126 -- The situation in a declarative region is more complex. The declaration
127 -- of Q could belong to the outer region, and we do not know that we have
128 -- an error until we hit the begin. It is still not clear at this point
129 -- from a syntactic point of view that something is wrong, because the
130 -- begin could belong to the enclosing subprogram or package. However, we
131 -- can incorporate a bit of semantic knowledge and note that the body of
132 -- X is missing, so we definitely DO have an error. We diagnose this error
133 -- as semicolon in place of IS on the subprogram line.
135 -- There are two styles for this diagnostic. If the begin immediately
136 -- follows the semicolon, then we can place a flag (IS expected) right
137 -- on the semicolon. Otherwise we do not detect the error until we hit
138 -- the begin which refers back to the line with the semicolon.
140 -- To control the process in the second case, the following global
141 -- variables are set to indicate that we have a subprogram declaration
142 -- whose body is required and has not yet been found. The prefix SIS
143 -- stands for "Subprogram IS" handling.
145 SIS_Entry_Active : Boolean := False;
146 -- Set True to indicate that an entry is active (i.e. that a subprogram
147 -- declaration has been encountered, and no body for this subprogram has
148 -- been encountered). The remaining fields are valid only if this is True.
151 -- Subprogram designator
153 SIS_Sloc : Source_Ptr;
154 -- Source location of FUNCTION/PROCEDURE keyword
156 SIS_Ecol : Column_Number;
157 -- Column number of FUNCTION/PROCEDURE keyword
159 SIS_Semicolon_Sloc : Source_Ptr;
160 -- Source location of semicolon at end of subprogram declaration
162 SIS_Declaration_Node : Node_Id;
163 -- Pointer to tree node for subprogram declaration
165 SIS_Missing_Semicolon_Message : Error_Msg_Id;
166 -- Used to save message ID of missing semicolon message (which will be
167 -- modified to missing IS if necessary). Set to No_Error_Msg in the
168 -- normal (non-error) case.
170 -- Five things can happen to an active SIS entry
172 -- 1. If a BEGIN is encountered with an SIS entry active, then we have
173 -- exactly the situation in which we know the body of the subprogram is
174 -- missing. After posting an error message, we change the spec to a body,
175 -- rechaining the declarations that intervened between the spec and BEGIN.
177 -- 2. Another subprogram declaration or body is encountered. In this
178 -- case the entry gets overwritten with the information for the new
179 -- subprogram declaration. We don't catch some nested cases this way,
180 -- but it doesn't seem worth the effort.
182 -- 3. A nested declarative region (e.g. package declaration or package
183 -- body) is encountered. The SIS active indication is reset at the start
184 -- of such a nested region. Again, like case 2, this causes us to miss
185 -- some nested cases, but it doesn't seen worth the effort to stack and
186 -- unstack the SIS information. Maybe we will reconsider this if we ever
187 -- get a complaint about a missed case.
189 -- 4. We encounter a valid pragma INTERFACE or IMPORT that effectively
190 -- supplies the missing body. In this case we reset the entry.
192 -- 5. We encounter the end of the declarative region without encountering
193 -- a BEGIN first. In this situation we simply reset the entry. We know
194 -- that there is a missing body, but it seems more reasonable to let the
195 -- later semantic checking discover this.
197 ----------------------------------------------------
198 -- Handling of Reserved Words Used as Identifiers --
199 ----------------------------------------------------
201 -- Note: throughout the parser, the terms reserved word and keyword are
202 -- used interchangeably to refer to the same set of reserved keywords
203 -- (including until, protected, etc).
205 -- If a reserved word is used in place of an identifier, the parser where
206 -- possible tries to recover gracefully. In particular, if the keyword is
207 -- clearly spelled using identifier casing, e.g. Until in a source program
208 -- using mixed case identifiers and lower case keywords, then the keyword
209 -- is treated as an identifier if it appears in a place where an identifier
212 -- The situation is more complex if the keyword is spelled with normal
213 -- keyword casing. In this case, the parser is more reluctant to consider
214 -- it to be intended as an identifier, unless it has some further
217 -- In the case of an identifier appearing in the identifier list of a
218 -- declaration, the appearance of a comma or colon right after the keyword
219 -- on the same line is taken as confirmation. For an enumeration literal,
220 -- a comma or right paren right after the identifier is also treated as
221 -- adequate confirmation.
223 -- The following type is used in calls to Is_Reserved_Identifier and
224 -- also to P_Defining_Identifier and P_Identifier. The default for all
225 -- these functions is that reserved words in reserved word case are not
226 -- considered to be reserved identifiers. The Id_Check value indicates
227 -- tokens, which if they appear immediately after the identifier, are
228 -- taken as confirming that the use of an identifier was expected
232 -- Default, no special token test
235 -- Consider as identifier if followed by comma or right paren
238 -- Consider as identifier if followed by comma or colon
241 -- Consider as identifier if followed by DO
244 -- Consider as identifier if followed by period
247 -- Consider as identifier if followed by >>
250 -- Consider as identifier if followed by IN
253 -- Consider as identifier if followed by IS
255 C_Left_Paren_Semicolon,
256 -- Consider as identifier if followed by left paren or semicolon
259 -- Consider as identifier if followed by USE
261 C_Vertical_Bar_Arrow);
262 -- Consider as identifier if followed by | or =>
264 --------------------------------------------
265 -- Handling IS Used in Place of Semicolon --
266 --------------------------------------------
268 -- This is a somewhat trickier situation, and we can't catch it in all
269 -- cases, but we do our best to detect common situations resulting from
270 -- a "cut and paste" operation which forgets to change the IS to semicolon.
271 -- Consider the following example:
286 -- The trouble is that the section of text from PROCEDURE B through END;
287 -- constitutes a valid procedure body, and the danger is that we find out
288 -- far too late that something is wrong (indeed most compilers will behave
289 -- uncomfortably on the above example).
291 -- We have two approaches to helping to control this situation. First we
292 -- make every attempt to avoid swallowing the last END; if we can be sure
293 -- that some error will result from doing so. In particular, we won't
294 -- accept the END; unless it is exactly correct (in particular it must not
295 -- have incorrect name tokens), and we won't accept it if it is immediately
296 -- followed by end of file, WITH or SEPARATE (all tokens that unmistakeably
297 -- signal the start of a compilation unit, and which therefore allow us to
298 -- reserve the END; for the outer level.) For more details on this aspect
299 -- of the handling, see package Par.Endh.
301 -- If we can avoid eating up the END; then the result in the absence of
302 -- any additional steps would be to post a missing END referring back to
303 -- the subprogram with the bogus IS. Similarly, if the enclosing package
304 -- has no BEGIN, then the result is a missing BEGIN message, which again
305 -- refers back to the subprogram header.
307 -- Such an error message is not too bad (it's already a big improvement
308 -- over what many parsers do), but it's not ideal, because the declarations
309 -- following the IS have been absorbed into the wrong scope. In the above
310 -- case, this could result for example in a bogus complaint that the body
311 -- of D was missing from the package.
313 -- To catch at least some of these cases, we take the following additional
314 -- steps. First, a subprogram body is marked as having a suspicious IS if
315 -- the declaration line is followed by a line which starts with a symbol
316 -- that can start a declaration in the same column, or to the left of the
317 -- column in which the FUNCTION or PROCEDURE starts (normal style is to
318 -- indent any declarations which really belong a subprogram). If such a
319 -- subprogram encounters a missing BEGIN or missing END, then we decide
320 -- that the IS should have been a semicolon, and the subprogram body node
321 -- is marked (by setting the Bad_Is_Detected flag true. Note that we do
322 -- not do this for library level procedures, only for nested procedures,
323 -- since for library level procedures, we must have a body.
325 -- The processing for a declarative part checks to see if the last
326 -- declaration scanned is marked in this way, and if it is, the tree
327 -- is modified to reflect the IS being interpreted as a semicolon.
329 ---------------------------------------------------
330 -- Parser Type Definitions and Control Variables --
331 ---------------------------------------------------
333 -- The following variable and associated type declaration are used by the
334 -- expression parsing routines to return more detailed information about
335 -- the categorization of a parsed expression.
337 type Expr_Form_Type is (
338 EF_Simple_Name, -- Simple name, i.e. possibly qualified identifier
339 EF_Name, -- Simple expression which could also be a name
340 EF_Simple, -- Simple expression which is not call or name
341 EF_Range_Attr, -- Range attribute reference
342 EF_Non_Simple); -- Expression that is not a simple expression
344 Expr_Form : Expr_Form_Type;
346 -- The following type is used for calls to P_Subprogram, P_Package, P_Task,
347 -- P_Protected to indicate which of several possibilities is acceptable.
349 type Pf_Rec is record
350 Spcn : Boolean; -- True if specification OK
351 Decl : Boolean; -- True if declaration OK
352 Gins : Boolean; -- True if generic instantiation OK
353 Pbod : Boolean; -- True if proper body OK
354 Rnam : Boolean; -- True if renaming declaration OK
355 Stub : Boolean; -- True if body stub OK
356 Pexp : Boolean; -- True if parametried expression OK
357 Fil2 : Boolean; -- Filler to fill to 8 bits
359 pragma Pack (Pf_Rec);
361 function T return Boolean renames True;
362 function F return Boolean renames False;
364 Pf_Decl_Gins_Pbod_Rnam_Stub_Pexp : constant Pf_Rec :=
365 Pf_Rec'(F, T, T, T, T, T, T, F);
366 Pf_Decl_Pexp : constant Pf_Rec :=
367 Pf_Rec'(F, T, F, F, F, F, T, F);
368 Pf_Decl_Gins_Pbod_Rnam_Pexp : constant Pf_Rec :=
369 Pf_Rec'(F, T, T, T, T, F, T, F);
370 Pf_Decl_Pbod_Pexp : constant Pf_Rec :=
371 Pf_Rec'(F, T, F, T, F, F, T, F);
372 Pf_Pbod_Pexp : constant Pf_Rec :=
373 Pf_Rec'(F, F, F, T, F, F, T, F);
374 Pf_Spcn : constant Pf_Rec :=
375 Pf_Rec'(T, F, F, F, F, F, F, F);
376 -- The above are the only allowed values of Pf_Rec arguments
378 type SS_Rec is record
379 Eftm : Boolean; -- ELSIF can terminate sequence
380 Eltm : Boolean; -- ELSE can terminate sequence
381 Extm : Boolean; -- EXCEPTION can terminate sequence
382 Ortm : Boolean; -- OR can terminate sequence
383 Sreq : Boolean; -- at least one statement required
384 Tatm : Boolean; -- THEN ABORT can terminate sequence
385 Whtm : Boolean; -- WHEN can terminate sequence
386 Unco : Boolean; -- Unconditional terminate after one statement
388 pragma Pack (SS_Rec);
390 SS_Eftm_Eltm_Sreq : constant SS_Rec := SS_Rec'(T, T, F, F, T, F, F, F);
391 SS_Eltm_Ortm_Tatm : constant SS_Rec := SS_Rec'(F, T, F, T, F, T, F, F);
392 SS_Extm_Sreq : constant SS_Rec := SS_Rec'(F, F, T, F, T, F, F, F);
393 SS_None : constant SS_Rec := SS_Rec'(F, F, F, F, F, F, F, F);
394 SS_Ortm_Sreq : constant SS_Rec := SS_Rec'(F, F, F, T, T, F, F, F);
395 SS_Sreq : constant SS_Rec := SS_Rec'(F, F, F, F, T, F, F, F);
396 SS_Sreq_Whtm : constant SS_Rec := SS_Rec'(F, F, F, F, T, F, T, F);
397 SS_Whtm : constant SS_Rec := SS_Rec'(F, F, F, F, F, F, T, F);
398 SS_Unco : constant SS_Rec := SS_Rec'(F, F, F, F, F, F, F, T);
400 Goto_List : Elist_Id;
401 -- List of goto nodes appearing in the current compilation. Used to
402 -- recognize natural loops and convert them into bona fide loops for
403 -- optimization purposes.
405 Label_List : Elist_Id;
406 -- List of label nodes for labels appearing in the current compilation.
407 -- Used by Par.Labl to construct the corresponding implicit declarations.
413 -- The scope table, also referred to as the scope stack, is used to record
414 -- the current scope context. It is organized as a stack, with inner nested
415 -- entries corresponding to higher entries on the stack. An entry is made
416 -- when the parser encounters the opening of a nested construct (such as a
417 -- record, task, package etc.), and then package Par.Endh uses this stack
418 -- to deal with END lines (including properly dealing with END nesting
422 -- Type of end entry required for this scope. The last two entries are
423 -- used only in the subprogram body case to mark the case of a suspicious
424 -- IS, or a bad IS (i.e. suspicions confirmed by missing BEGIN or END).
425 -- See separate section on dealing with IS used in place of semicolon.
426 -- Note that for many purposes E_Name, E_Suspicious_Is and E_Bad_Is are
427 -- treated the same (E_Suspicious_Is and E_Bad_Is are simply special cases
428 -- of E_Name). They are placed at the end of the enumeration so that a
429 -- test for >= E_Name catches all three cases efficiently.
431 (E_Dummy, -- dummy entry at outer level
435 E_Record, -- END RECORD;
436 E_Return, -- END RETURN;
437 E_Select, -- END SELECT;
438 E_Name, -- END [name];
439 E_Suspicious_Is, -- END [name]; (case of suspicious IS)
440 E_Bad_Is); -- END [name]; (case of bad IS)
442 -- The following describes a single entry in the scope table
444 type Scope_Table_Entry is record
446 -- Type of end entry, as per above description
449 -- A flag indicating whether the label, if present, is required to
450 -- appear on the end line. It is referenced only in the case of Etyp is
451 -- equal to E_Name or E_Suspicious_Is where the name may or may not be
452 -- required (yes for labeled block, no in other cases). Note that for
453 -- all cases except begin, the question of whether a label is required
454 -- can be determined from the other fields (for loop, it is required if
455 -- it is present, and for the other constructs it is never required or
458 Ecol : Column_Number;
459 -- Contains the absolute column number (with tabs expanded) of the
460 -- expected column of the end assuming normal Ada indentation usage. If
461 -- the RM_Column_Check mode is set, this value is used for generating
462 -- error messages about indentation. Otherwise it is used only to
463 -- control heuristic error recovery actions.
466 -- This field is used only for the LOOP and BEGIN cases, and is the
467 -- Node_Id value of the label name. For all cases except child units,
468 -- this value is an entity whose Chars field contains the name pointer
469 -- that identifies the label uniquely. For the child unit case the Labl
470 -- field references an N_Defining_Program_Unit_Name node for the name.
471 -- For cases other than LOOP or BEGIN, the Label field is set to Error,
472 -- indicating that it is an error to have a label on the end line.
473 -- (this is really a misuse of Error since there is no Error ???)
476 -- Points to the list of declarations (i.e. the declarative part)
477 -- associated with this construct. It is set only in the END [name]
478 -- cases, and is set to No_List for all other cases which do not have a
479 -- declarative unit associated with them. This is used for determining
480 -- the proper location for implicit label declarations.
483 -- Empty except in the case of entries for IF and CASE statements, in
484 -- which case it contains the N_If_Statement or N_Case_Statement node.
485 -- This is used for setting the End_Span field.
488 -- Source location of the opening token of the construct. This is used
489 -- to refer back to this line in error messages (such as missing or
490 -- incorrect end lines). The Sloc field is not used, and is not set, if
491 -- a label is present (the Labl field provides the text name of the
492 -- label in this case, which is fine for error messages).
495 -- S_Is is relevant only if Etyp is set to E_Suspicious_Is or E_Bad_Is.
496 -- It records the location of the IS that is considered to be
500 -- A boolean flag that is set true if the opening entry is the dubious
501 -- result of some prior error, e.g. a record entry where the record
502 -- keyword was missing. It is used to suppress the issuing of a
503 -- corresponding junk complaint about the end line (we do not want
504 -- to complain about a missing end record when there was no record).
507 -- The following declares the scope table itself. The Last field is the
508 -- stack pointer, so that Scope.Table (Scope.Last) is the top entry. The
509 -- oldest entry, at Scope_Stack (0), is a dummy entry with Etyp set to
510 -- E_Dummy, and the other fields undefined. This dummy entry ensures that
511 -- Scope_Stack (Scope_Stack_Ptr).Etyp can always be tested, and that the
512 -- scope stack pointer is always in range.
514 package Scope is new Table.Table (
515 Table_Component_Type => Scope_Table_Entry,
516 Table_Index_Type => Int,
517 Table_Low_Bound => 0,
519 Table_Increment => 100,
520 Table_Name => "Scope");
522 ---------------------------------
523 -- Parsing Routines by Chapter --
524 ---------------------------------
526 -- Uncommented declarations in this section simply parse the construct
527 -- corresponding to their name, and return an ID value for the Node or
528 -- List that is created.
535 function P_Pragma (Skipping : Boolean := False) return Node_Id;
536 -- Scan out a pragma. If Skipping is True, then the caller is skipping
537 -- the pragma in the context of illegal placement (this is used to avoid
538 -- some junk cascaded messages).
540 function P_Identifier (C : Id_Check := None) return Node_Id;
541 -- Scans out an identifier. The parameter C determines the treatment
542 -- of reserved identifiers. See declaration of Id_Check for details.
544 function P_Pragmas_Opt return List_Id;
545 -- This function scans for a sequence of pragmas in other than a
546 -- declaration sequence or statement sequence context. All pragmas
547 -- can appear except pragmas Assert and Debug, which are only allowed
548 -- in a declaration or statement sequence context.
550 procedure P_Pragmas_Misplaced;
551 -- Skips misplaced pragmas with a complaint
553 procedure P_Pragmas_Opt (List : List_Id);
554 -- Parses optional pragmas and appends them to the List
562 Missing_Begin_Msg : Error_Msg_Id;
563 -- This variable is set by a call to P_Declarative_Part. Normally it
564 -- is set to No_Error_Msg, indicating that no special processing is
565 -- required by the caller. The special case arises when a statement
566 -- is found in the sequence of declarations. In this case the Id of
567 -- the message issued ("declaration expected") is preserved in this
568 -- variable, then the caller can change it to an appropriate missing
569 -- begin message if indeed the BEGIN is missing.
571 function P_Array_Type_Definition return Node_Id;
572 function P_Basic_Declarative_Items return List_Id;
573 function P_Constraint_Opt return Node_Id;
574 function P_Declarative_Part return List_Id;
575 function P_Discrete_Choice_List return List_Id;
576 function P_Discrete_Range return Node_Id;
577 function P_Discrete_Subtype_Definition return Node_Id;
578 function P_Known_Discriminant_Part_Opt return List_Id;
579 function P_Signed_Integer_Type_Definition return Node_Id;
580 function P_Range return Node_Id;
581 function P_Range_Constraint return Node_Id;
582 function P_Record_Definition return Node_Id;
583 function P_Subtype_Mark return Node_Id;
584 function P_Subtype_Mark_Resync return Node_Id;
585 function P_Unknown_Discriminant_Part_Opt return Boolean;
587 function P_Access_Definition
588 (Null_Exclusion_Present : Boolean) return Node_Id;
589 -- Ada 2005 (AI-231/AI-254): The caller parses the null-exclusion part
590 -- and indicates if it was present
592 function P_Access_Type_Definition
593 (Header_Already_Parsed : Boolean := False) return Node_Id;
594 -- Ada 2005 (AI-254): The formal is used to indicate if the caller has
595 -- parsed the null_exclusion part. In this case the caller has also
596 -- removed the ACCESS token
598 procedure P_Component_Items (Decls : List_Id);
599 -- Scan out one or more component items and append them to the given
600 -- list. Only scans out more than one declaration in the case where the
601 -- source has a single declaration with multiple defining identifiers.
603 function P_Defining_Identifier (C : Id_Check := None) return Node_Id;
604 -- Scan out a defining identifier. The parameter C controls the
605 -- treatment of errors in case a reserved word is scanned. See the
606 -- declaration of this type for details.
608 function P_Interface_Type_Definition
609 (Abstract_Present : Boolean) return Node_Id;
610 -- Ada 2005 (AI-251): Parse the interface type definition part. Abstract
611 -- Present indicates if the reserved word "abstract" has been previously
612 -- found. It is used to report an error message because interface types
613 -- are by definition abstract tagged. We generate a record_definition
614 -- node if the list of interfaces is empty; otherwise we generate a
615 -- derived_type_definition node (the first interface in this list is the
616 -- ancestor interface).
618 function P_Null_Exclusion
619 (Allow_Anonymous_In_95 : Boolean := False) return Boolean;
620 -- Ada 2005 (AI-231): Parse the null-excluding part. A True result
621 -- indicates that the null-excluding part was present.
623 -- Allow_Anonymous_In_95 is True if we are in a context that allows
624 -- anonymous access types in Ada 95, in which case "not null" is legal
625 -- if it precedes "access".
627 function P_Subtype_Indication
628 (Not_Null_Present : Boolean := False) return Node_Id;
629 -- Ada 2005 (AI-231): The flag Not_Null_Present indicates that the
630 -- null-excluding part has been scanned out and it was present.
632 function P_Range_Or_Subtype_Mark
633 (Allow_Simple_Expression : Boolean := False) return Node_Id;
634 -- Scans out a range or subtype mark, and also permits a general simple
635 -- expression if Allow_Simple_Expresion is set to True.
637 function Init_Expr_Opt (P : Boolean := False) return Node_Id;
638 -- If an initialization expression is present (:= expression), then
639 -- it is scanned out and returned, otherwise Empty is returned if no
640 -- initialization expression is present. This procedure also handles
641 -- certain common error cases cleanly. The parameter P indicates if
642 -- a right paren can follow the expression (default = no right paren
645 procedure Skip_Declaration (S : List_Id);
646 -- Used when scanning statements to skip past a misplaced declaration
647 -- The declaration is scanned out and appended to the given list.
648 -- Token is known to be a declaration token (in Token_Class_Declk)
649 -- on entry, so there definition is a declaration to be scanned.
651 function P_Subtype_Indication
652 (Subtype_Mark : Node_Id;
653 Not_Null_Present : Boolean := False) return Node_Id;
654 -- This version of P_Subtype_Indication is called when the caller has
655 -- already scanned out the subtype mark which is passed as a parameter.
656 -- Ada 2005 (AI-231): The flag Not_Null_Present indicates that the
657 -- null-excluding part has been scanned out and it was present.
659 function P_Subtype_Mark_Attribute (Type_Node : Node_Id) return Node_Id;
660 -- Parse a subtype mark attribute. The caller has already parsed the
661 -- subtype mark, which is passed in as the argument, and has checked
662 -- that the current token is apostrophe.
670 function P_Aggregate return Node_Id;
671 function P_Expression return Node_Id;
672 function P_Expression_Or_Range_Attribute return Node_Id;
673 function P_Function_Name return Node_Id;
674 function P_Name return Node_Id;
675 function P_Qualified_Simple_Name return Node_Id;
676 function P_Qualified_Simple_Name_Resync return Node_Id;
677 function P_Simple_Expression return Node_Id;
678 function P_Simple_Expression_Or_Range_Attribute return Node_Id;
680 function P_Case_Expression return Node_Id;
681 -- Scans out a case expression. Called with Token pointing to the CASE
682 -- keyword, and returns pointing to the terminating right parent,
683 -- semicolon, or comma, but does not consume this terminating token.
685 function P_Conditional_Expression return Node_Id;
686 -- Scans out a conditional expression. Called with Token pointing to
687 -- the IF keyword, and returns pointing to the terminating right paren,
688 -- semicolon or comma, but does not consume this terminating token.
690 function P_Expression_If_OK return Node_Id;
691 -- Scans out an expression in a context where a conditional expression
692 -- is permitted to appear without surrounding parentheses.
694 function P_Expression_No_Right_Paren return Node_Id;
695 -- Scans out an expression in contexts where the expression cannot be
696 -- terminated by a right paren (gives better error recovery if an errant
697 -- right paren is found after the expression).
699 function P_Expression_Or_Range_Attribute_If_OK return Node_Id;
700 -- Scans out an expression or range attribute where a conditional
701 -- expression is permitted to appear without surrounding parentheses.
703 function P_Qualified_Expression (Subtype_Mark : Node_Id) return Node_Id;
704 -- This routine scans out a qualified expression when the caller has
705 -- already scanned out the name and apostrophe of the construct.
707 function P_Quantified_Expression return Node_Id;
708 -- This routine scans out a quantified expression when the caller has
709 -- already scanned out the keyword "for" of the construct.
717 function P_Condition return Node_Id;
718 -- Scan out and return a condition
720 function P_Loop_Parameter_Specification return Node_Id;
721 -- Used in loop constructs and quantified expressions.
723 function P_Statement_Name (Name_Node : Node_Id) return Node_Id;
724 -- Given a node representing a name (which is a call), converts it
725 -- to the syntactically corresponding procedure call statement.
727 function P_Sequence_Of_Statements (SS_Flags : SS_Rec) return List_Id;
728 -- The argument indicates the acceptable termination tokens.
729 -- See body in Par.Ch5 for details of the use of this parameter.
731 procedure Parse_Decls_Begin_End (Parent : Node_Id);
732 -- Parses declarations and handled statement sequence, setting
733 -- fields of Parent node appropriately.
741 function P_Designator return Node_Id;
742 function P_Defining_Program_Unit_Name return Node_Id;
743 function P_Formal_Part return List_Id;
744 function P_Parameter_Profile return List_Id;
745 function P_Return_Statement return Node_Id;
746 function P_Subprogram_Specification return Node_Id;
748 procedure P_Mode (Node : Node_Id);
749 -- Sets In_Present and/or Out_Present flags in Node scanning past IN,
750 -- OUT or IN OUT tokens in the source.
752 function P_Subprogram (Pf_Flags : Pf_Rec) return Node_Id;
753 -- Scans out any construct starting with either of the keywords
754 -- PROCEDURE or FUNCTION. The parameter indicates which possible
755 -- possible kinds of construct (body, spec, instantiation etc.)
756 -- are permissible in the current context.
766 Decl : Node_Id := Empty) return Node_Id;
767 -- Scans out any construct starting with the keyword PACKAGE. The
768 -- parameter indicates which possible kinds of construct (body, spec,
769 -- instantiation etc.) are permissible in the current context. Decl
770 -- is set in the specification case to request that if there are aspect
771 -- specifications present, they be associated with this declaration.
779 function P_Use_Clause return Node_Id;
787 function P_Abort_Statement return Node_Id;
788 function P_Abortable_Part return Node_Id;
789 function P_Accept_Statement return Node_Id;
790 function P_Delay_Statement return Node_Id;
791 function P_Entry_Body return Node_Id;
792 function P_Protected return Node_Id;
793 function P_Requeue_Statement return Node_Id;
794 function P_Select_Statement return Node_Id;
795 function P_Task return Node_Id;
796 function P_Terminate_Alternative return Node_Id;
804 function P_Compilation_Unit return Node_Id;
805 -- Note: this function scans a single compilation unit, and checks that
806 -- an end of file follows this unit, diagnosing any unexpected input as
807 -- an error, and then skipping it, so that Token is set to Tok_EOF on
808 -- return. An exception is in syntax-only mode, where multiple
809 -- compilation units are permitted. In this case, P_Compilation_Unit
810 -- does not check for end of file and there may be more compilation
811 -- units to scan. The caller can uniquely detect this situation by the
812 -- fact that Token is not set to Tok_EOF on return.
814 -- What about multiple unit/file capability that now exists???
816 -- The Ignore parameter is normally set False. It is set True in the
817 -- multiple unit per file mode if we are skipping past a unit that we
818 -- are not interested in.
826 function P_Handled_Sequence_Of_Statements return Node_Id;
827 function P_Raise_Statement return Node_Id;
829 function Parse_Exception_Handlers return List_Id;
830 -- Parses the partial construct EXCEPTION followed by a list of
831 -- exception handlers which appears in a number of productions, and
832 -- returns the list of exception handlers.
840 function P_Generic return Node_Id;
841 function P_Generic_Actual_Part_Opt return List_Id;
849 function P_Representation_Clause return Node_Id;
851 function Aspect_Specifications_Present return Boolean;
852 -- This function tests whether the next keyword is WITH followed by
853 -- something that looks reasonably like an aspect specification. If so,
854 -- True is returned. Otherwise False is returned. In either case control
855 -- returns with the token pointer unchanged (i.e. pointing to the WITH
856 -- token in the case where True is returned). This function takes care
857 -- of generating appropriate messages if aspect specifications appear
858 -- in versions of Ada prior to Ada 2012.
860 procedure P_Aspect_Specifications (Decl : Node_Id);
861 -- This subprogram is called with the current token pointing to either a
862 -- WITH keyword starting an aspect specification, or a semicolon. In the
863 -- former case, the aspect specifications are scanned out including the
864 -- terminating semicolon, the Has_Aspect_Specifications flag is set in
865 -- the given declaration node, and the list of aspect specifications is
866 -- constructed and associated with this declaration node using a call to
867 -- Set_Aspect_Specifications. If no WITH keyword is present, then this
868 -- call has no effect other than scanning out the semicolon. If Decl is
869 -- Error on entry, any scanned aspect specifications are ignored and a
870 -- message is output saying aspect specifications not permitted here.
872 function P_Code_Statement (Subtype_Mark : Node_Id) return Node_Id;
873 -- Function to parse a code statement. The caller has scanned out
874 -- the name to be used as the subtype mark (but has not checked that
875 -- it is suitable for use as a subtype mark, i.e. is either an
876 -- identifier or a selected component). The current token is an
877 -- apostrophe and the following token is either a left paren or
878 -- RANGE (the latter being an error to be caught by P_Code_Statement.
881 -- Note: the parsing for annexe J features (i.e. obsolescent features)
882 -- is found in the logical section where these features would be if
883 -- they were not obsolescent. In particular:
885 -- Delta constraint is parsed by P_Delta_Constraint (3.5.9)
886 -- At clause is parsed by P_At_Clause (13.1)
887 -- Mod clause is parsed by P_Mod_Clause (13.5.1)
893 -- Routines for handling end lines, including scope recovery
896 function Check_End (Decl : Node_Id := Empty) return Boolean;
897 -- Called when an end sequence is required. In the absence of an error
898 -- situation, Token contains Tok_End on entry, but in a missing end
899 -- case, this may not be the case. Pop_End_Context is used to determine
900 -- the appropriate action to be taken. The returned result is True if
901 -- an End sequence was encountered and False if no End sequence was
902 -- present. This occurs if the END keyword encountered was determined
903 -- to be improper and deleted (i.e. Pop_End_Context set End_Action to
904 -- Skip_And_Reject). Note that the END sequence includes a semicolon,
905 -- except in the case of END RECORD, where a semicolon follows the END
906 -- RECORD, but is not part of the record type definition itself.
908 -- If Decl is non-empty, then aspect specifications are permitted
909 -- following the end, and Decl is the declaration node with which
910 -- these aspect specifications are to be associated.
913 -- Skip past an end sequence. On entry Token contains Tok_End, and we
914 -- we know that the end sequence is syntactically incorrect, and that
915 -- an appropriate error message has already been posted. The mission
916 -- is simply to position the scan pointer to be the best guess of the
917 -- position after the end sequence. We do not issue any additional
918 -- error messages while carrying this out.
920 procedure End_Statements
921 (Parent : Node_Id := Empty;
922 Decl : Node_Id := Empty);
923 -- Called when an end is required or expected to terminate a sequence
924 -- of statements. The caller has already made an appropriate entry in
925 -- the Scope.Table to describe the expected form of the end. This can
926 -- only be used in cases where the only appropriate terminator is end.
927 -- If Parent is non-empty, then if a correct END line is encountered,
928 -- the End_Label field of Parent is set appropriately.
930 -- If Decl is non-null, then it is a declaration node, and aspect
931 -- specifications are permitted after the end statement. These aspect
932 -- specifications, if present, are stored in this declaration node.
939 -- These procedures are used to resynchronize after errors. Following an
940 -- error which is not immediately locally recoverable, the exception
941 -- Error_Resync is raised. The handler for Error_Resync typically calls
942 -- one of these recovery procedures to resynchronize the source position
943 -- to a point from which parsing can be restarted.
945 -- Note: these procedures output an information message that tokens are
946 -- being skipped, but this message is output only if the option for
947 -- Multiple_Errors_Per_Line is set in Options.
950 procedure Resync_Choice;
951 -- Used if an error occurs scanning a choice. The scan pointer is
952 -- advanced to the next vertical bar, arrow, or semicolon, whichever
953 -- comes first. We also quit if we encounter an end of file.
955 procedure Resync_Expression;
956 -- Used if an error is detected during the parsing of an expression.
957 -- It skips past tokens until either a token which cannot be part of
958 -- an expression is encountered (an expression terminator), or if a
959 -- comma or right parenthesis or vertical bar is encountered at the
960 -- current parenthesis level (a parenthesis level counter is maintained
961 -- to carry out this test).
963 procedure Resync_Past_Semicolon;
964 -- Used if an error occurs while scanning a sequence of declarations.
965 -- The scan pointer is positioned past the next semicolon and the scan
966 -- resumes. The scan is also resumed on encountering a token which
967 -- starts a declaration (but we make sure to skip at least one token
968 -- in this case, to avoid getting stuck in a loop).
970 procedure Resync_To_Semicolon;
971 -- Similar to Resync_Past_Semicolon, except that the scan pointer is
972 -- left pointing to the semicolon rather than past it.
974 procedure Resync_Past_Semicolon_Or_To_Loop_Or_Then;
975 -- Used if an error occurs while scanning a sequence of statements. The
976 -- scan pointer is positioned past the next semicolon, or to the next
977 -- occurrence of either then or loop, and the scan resumes.
979 procedure Resync_To_When;
980 -- Used when an error occurs scanning an entry index specification. The
981 -- scan pointer is positioned to the next WHEN (or to IS or semicolon if
982 -- either of these appear before WHEN, indicating another error has
985 procedure Resync_Semicolon_List;
986 -- Used if an error occurs while scanning a parenthesized list of items
987 -- separated by semicolons. The scan pointer is advanced to the next
988 -- semicolon or right parenthesis at the outer parenthesis level, or
989 -- to the next is or RETURN keyword occurrence, whichever comes first.
991 procedure Resync_Cunit;
992 -- Synchronize to next token which could be the start of a compilation
993 -- unit, or to the end of file token.
1000 -- Routines to check for expected tokens
1004 -- Procedures with names of the form T_xxx, where Tok_xxx is a token
1005 -- name, check that the current token matches the required token, and
1006 -- if so, scan past it. If not, an error is issued indicating that
1007 -- the required token is not present (xxx expected). In most cases, the
1008 -- scan pointer is not moved in the not-found case, but there are some
1009 -- exceptions to this, see for example T_Id, where the scan pointer is
1010 -- moved across a literal appearing where an identifier is expected.
1018 procedure T_Colon_Equal;
1020 procedure T_Dot_Dot;
1022 procedure T_Greater_Greater;
1023 procedure T_Identifier;
1026 procedure T_Left_Paren;
1032 procedure T_Private;
1035 procedure T_Right_Paren;
1036 procedure T_Semicolon;
1043 -- Procedures having names of the form TF_xxx, where Tok_xxx is a token
1044 -- name check that the current token matches the required token, and
1045 -- if so, scan past it. If not, an error message is issued indicating
1046 -- that the required token is not present (xxx expected).
1048 -- If the missing token is at the end of the line, then control returns
1049 -- immediately after posting the message. If there are remaining tokens
1050 -- on the current line, a search is conducted to see if the token
1051 -- appears later on the current line, as follows:
1053 -- A call to Scan_Save is issued and a forward search for the token
1054 -- is carried out. If the token is found on the current line before a
1055 -- semicolon, then it is scanned out and the scan continues from that
1056 -- point. If not the scan is restored to the point where it was missing.
1061 procedure TF_Return;
1062 procedure TF_Semicolon;
1066 -- Procedures with names of the form U_xxx, where Tok_xxx is a token
1067 -- name, are just like the corresponding T_xxx procedures except that
1068 -- an error message, if given, is unconditional.
1070 procedure U_Left_Paren;
1071 procedure U_Right_Paren;
1079 function Bad_Spelling_Of (T : Token_Type) return Boolean;
1080 -- This function is called in an error situation. It checks if the
1081 -- current token is an identifier whose name is a plausible bad
1082 -- spelling of the given keyword token, and if so, issues an error
1083 -- message, sets Token from T, and returns True. Otherwise Token is
1084 -- unchanged, and False is returned.
1086 procedure Check_Bad_Layout;
1087 -- Check for bad indentation in RM checking mode. Used for statements
1088 -- and declarations. Checks if current token is at start of line and
1089 -- is exdented from the current expected end column, and if so an
1090 -- error message is generated.
1092 procedure Check_Misspelling_Of (T : Token_Type);
1093 pragma Inline (Check_Misspelling_Of);
1094 -- This is similar to the function above, except that it does not
1095 -- return a result. It is typically used in a situation where any
1096 -- identifier is an error, and it makes sense to simply convert it
1097 -- to the given token if it is a plausible misspelling of it.
1099 procedure Check_95_Keyword (Token_95, Next : Token_Type);
1100 -- This routine checks if the token after the current one matches the
1101 -- Next argument. If so, the scan is backed up to the current token
1102 -- and Token_Type is changed to Token_95 after issuing an appropriate
1103 -- error message ("(Ada 83) keyword xx cannot be used"). If not,
1104 -- the scan is backed up with Token_Type unchanged. This routine
1105 -- is used to deal with an attempt to use a 95 keyword in Ada 83
1106 -- mode. The caller has typically checked that the current token,
1107 -- an identifier, matches one of the 95 keywords.
1109 procedure Check_Simple_Expression (E : Node_Id);
1110 -- Given an expression E, that has just been scanned, so that Expr_Form
1111 -- is still set, outputs an error if E is a non-simple expression. E is
1112 -- not modified by this call.
1114 procedure Check_Simple_Expression_In_Ada_83 (E : Node_Id);
1115 -- Like Check_Simple_Expression, except that the error message is only
1116 -- given when operating in Ada 83 mode, and includes "in Ada 83".
1118 function Check_Subtype_Mark (Mark : Node_Id) return Node_Id;
1119 -- Called to check that a node representing a name (or call) is
1120 -- suitable for a subtype mark, i.e, that it is an identifier or
1121 -- a selected component. If so, or if it is already Error, then
1122 -- it is returned unchanged. Otherwise an error message is issued
1123 -- and Error is returned.
1125 function Comma_Present return Boolean;
1126 -- Used in comma delimited lists to determine if a comma is present, or
1127 -- can reasonably be assumed to have been present (an error message is
1128 -- generated in the latter case). If True is returned, the scan has been
1129 -- positioned past the comma. If False is returned, the scan position
1130 -- is unchanged. Note that all comma-delimited lists are terminated by
1131 -- a right paren, so the only legitimate tokens when Comma_Present is
1132 -- called are right paren and comma. If some other token is found, then
1133 -- Comma_Present has the job of deciding whether it is better to pretend
1134 -- a comma was present, post a message for a missing comma and return
1135 -- True, or return False and let the caller diagnose the missing right
1138 procedure Discard_Junk_Node (N : Node_Id);
1139 procedure Discard_Junk_List (L : List_Id);
1140 pragma Inline (Discard_Junk_Node);
1141 pragma Inline (Discard_Junk_List);
1142 -- These procedures do nothing at all, their effect is simply to discard
1143 -- the argument. A typical use is to skip by some junk that is not
1144 -- expected in the current context.
1146 procedure Ignore (T : Token_Type);
1147 -- If current token matches T, then give an error message and skip
1148 -- past it, otherwise the call has no effect at all. T may be any
1149 -- reserved word token, or comma, left or right paren, or semicolon.
1151 function Is_Reserved_Identifier (C : Id_Check := None) return Boolean;
1152 -- Test if current token is a reserved identifier. This test is based
1153 -- on the token being a keyword and being spelled in typical identifier
1154 -- style (i.e. starting with an upper case letter). The parameter C
1155 -- determines the special treatment if a reserved word is encountered
1156 -- that has the normal casing of a reserved word.
1158 procedure Merge_Identifier (Prev : Node_Id; Nxt : Token_Type);
1159 -- Called when the previous token is an identifier (whose Token_Node
1160 -- value is given by Prev) to check if current token is an identifier
1161 -- that can be merged with the previous one adding an underscore. The
1162 -- merge is only attempted if the following token matches Nxt. If all
1163 -- conditions are met, an error message is issued, and the merge is
1164 -- carried out, modifying the Chars field of Prev.
1166 function Next_Token_Is (Tok : Token_Type) return Boolean;
1167 -- Looks at token after current one and returns True if the token type
1168 -- matches Tok. The scan is unconditionally restored on return.
1170 procedure No_Constraint;
1171 -- Called in a place where no constraint is allowed, but one might
1172 -- appear due to a common error (e.g. after the type mark in a procedure
1173 -- parameter. If a constraint is present, an error message is posted,
1174 -- and the constraint is scanned and discarded.
1176 procedure Push_Scope_Stack;
1177 pragma Inline (Push_Scope_Stack);
1178 -- Push a new entry onto the scope stack. Scope.Last (the stack pointer)
1179 -- is incremented. The Junk field is preinitialized to False. The caller
1180 -- is expected to fill in all remaining entries of the new top stack
1181 -- entry at Scope.Table (Scope.Last).
1183 procedure Pop_Scope_Stack;
1184 -- Pop an entry off the top of the scope stack. Scope_Last (the scope
1185 -- table stack pointer) is decremented by one. It is a fatal error to
1186 -- try to pop off the dummy entry at the bottom of the stack (i.e.
1187 -- Scope.Last must be non-zero at the time of call).
1189 function Separate_Present return Boolean;
1190 -- Determines if the current token is either Tok_Separate, or an
1191 -- identifier that is a possible misspelling of "separate" followed
1192 -- by a semicolon. True is returned if so, otherwise False.
1194 procedure Signal_Bad_Attribute;
1195 -- The current token is an identifier that is supposed to be an
1196 -- attribute identifier but is not. This routine posts appropriate
1197 -- error messages, including a check for a near misspelling.
1199 function Token_Is_At_Start_Of_Line return Boolean;
1200 pragma Inline (Token_Is_At_Start_Of_Line);
1201 -- Determines if the current token is the first token on the line
1203 function Token_Is_At_End_Of_Line return Boolean;
1204 -- Determines if the current token is the last token on the line
1212 -- The processing for pragmas is split off from chapter 2
1214 function Prag (Pragma_Node : Node_Id; Semi : Source_Ptr) return Node_Id;
1215 -- This function is passed a tree for a pragma that has been scanned out.
1216 -- The pragma is syntactically well formed according to the general syntax
1217 -- for pragmas and the pragma identifier is for one of the recognized
1218 -- pragmas. It performs specific syntactic checks for specific pragmas.
1219 -- The result is the input node if it is OK, or Error otherwise. The
1220 -- reason that this is separated out is to facilitate the addition
1221 -- of implementation defined pragmas. The second parameter records the
1222 -- location of the semicolon following the pragma (this is needed for
1223 -- correct processing of the List and Page pragmas). The returned value
1224 -- is a copy of Pragma_Node, or Error if an error is found. Note that
1225 -- at the point where Prag is called, the right paren ending the pragma
1226 -- has been scanned out, and except in the case of pragma Style_Checks,
1227 -- so has the following semicolon. For Style_Checks, the caller delays
1228 -- the scanning of the semicolon so that it will be scanned using the
1229 -- settings from the Style_Checks pragma preceding it.
1236 -- This procedure creates implicit label declarations for all labels that
1237 -- are declared in the current unit. Note that this could conceptually be
1238 -- done at the point where the labels are declared, but it is tricky to do
1239 -- it then, since the tree is not hooked up at the point where the label is
1240 -- declared (e.g. a sequence of statements is not yet attached to its
1241 -- containing scope at the point a label in the sequence is found).
1248 -- This procedure loads all subsidiary units that are required by this
1249 -- unit, including with'ed units, specs for bodies, and parents for child
1250 -- units. It does not load bodies for inlined procedures and generics,
1251 -- since we don't know till semantic analysis is complete what is needed.
1257 -- The package bodies can see all routines defined in all other subpackages
1277 package body Ch2 is separate;
1278 package body Ch3 is separate;
1279 package body Ch4 is separate;
1280 package body Ch5 is separate;
1281 package body Ch6 is separate;
1282 package body Ch7 is separate;
1283 package body Ch8 is separate;
1284 package body Ch9 is separate;
1285 package body Ch10 is separate;
1286 package body Ch11 is separate;
1287 package body Ch12 is separate;
1288 package body Ch13 is separate;
1290 package body Endh is separate;
1291 package body Tchk is separate;
1292 package body Sync is separate;
1293 package body Util is separate;
1295 function Prag (Pragma_Node : Node_Id; Semi : Source_Ptr) return Node_Id
1298 procedure Labl is separate;
1299 procedure Load is separate;
1301 -- Start of processing for Par
1304 Compiler_State := Parsing;
1306 -- Deal with configuration pragmas case first
1308 if Configuration_Pragmas then
1310 Pragmas : constant List_Id := Empty_List;
1315 if Token = Tok_EOF then
1316 Compiler_State := Analyzing;
1319 elsif Token /= Tok_Pragma then
1320 Error_Msg_SC ("only pragmas allowed in configuration file");
1321 Compiler_State := Analyzing;
1327 if Nkind (P_Node) = N_Pragma then
1329 -- Give error if bad pragma
1331 if not Is_Configuration_Pragma_Name (Pragma_Name (P_Node))
1332 and then Pragma_Name (P_Node) /= Name_Source_Reference
1334 if Is_Pragma_Name (Pragma_Name (P_Node)) then
1336 ("only configuration pragmas allowed " &
1337 "in configuration file", P_Node);
1340 ("unrecognized pragma in configuration file",
1344 -- Pragma is OK config pragma, so collect it
1347 Append (P_Node, Pragmas);
1354 -- Normal case of compilation unit
1357 Save_Opt_Config_Switches (Save_Config_Switches);
1359 -- The following loop runs more than once in syntax check mode
1360 -- where we allow multiple compilation units in the same file
1361 -- and in Multiple_Unit_Per_file mode where we skip units till
1362 -- we get to the unit we want.
1364 for Ucount in Pos loop
1365 Set_Opt_Config_Switches
1366 (Is_Internal_File_Name (File_Name (Current_Source_File)),
1367 Current_Source_Unit = Main_Unit);
1369 -- Initialize scope table and other parser control variables
1371 Compiler_State := Parsing;
1373 Scope.Increment_Last;
1374 Scope.Table (0).Etyp := E_Dummy;
1375 SIS_Entry_Active := False;
1376 Last_Resync_Point := No_Location;
1378 Goto_List := New_Elmt_List;
1379 Label_List := New_Elmt_List;
1381 -- If in multiple unit per file mode, skip past ignored unit
1383 if Ucount < Multiple_Unit_Index then
1385 -- We skip in syntax check only mode, since we don't want to do
1386 -- anything more than skip past the unit and ignore it. This means
1387 -- we skip processing like setting up a unit table entry.
1390 Save_Operating_Mode : constant Operating_Mode_Type :=
1393 Save_Style_Check : constant Boolean := Style_Check;
1396 Operating_Mode := Check_Syntax;
1397 Style_Check := False;
1398 Discard_Node (P_Compilation_Unit);
1399 Operating_Mode := Save_Operating_Mode;
1400 Style_Check := Save_Style_Check;
1402 -- If we are at an end of file, and not yet at the right unit,
1403 -- then we have a fatal error. The unit is missing.
1405 if Token = Tok_EOF then
1406 Error_Msg_SC ("file has too few compilation units");
1407 raise Unrecoverable_Error;
1411 -- Here if we are not skipping a file in multiple unit per file mode.
1412 -- Parse the unit that we are interested in. Note that in check
1413 -- syntax mode we are interested in all units in the file.
1417 Comp_Unit_Node : constant Node_Id := P_Compilation_Unit;
1420 -- If parsing was successful and we are not in check syntax
1421 -- mode, check that language-defined units are compiled in GNAT
1422 -- mode. For this purpose we do NOT consider renamings in annex
1423 -- J as predefined. That allows users to compile their own
1424 -- versions of these files, and in particular, in the VMS
1425 -- implementation, the DEC versions can be substituted for the
1426 -- standard Ada 95 versions. Another exception is System.RPC
1427 -- and its children. This allows a user to supply their own
1428 -- communication layer.
1430 if Comp_Unit_Node /= Error
1431 and then Operating_Mode = Generate_Code
1432 and then Current_Source_Unit = Main_Unit
1433 and then not GNAT_Mode
1436 Uname : constant String :=
1438 (Unit_Name (Current_Source_Unit));
1439 Name : String (1 .. Uname'Length - 2);
1442 -- Because Unit_Name includes "%s"/"%b", we need to strip
1443 -- the last two characters to get the real unit name.
1445 Name := Uname (Uname'First .. Uname'Last - 2);
1447 if Name = "ada" or else
1448 Name = "interfaces" or else
1452 ("language-defined units cannot be recompiled",
1453 Sloc (Unit (Comp_Unit_Node)));
1455 elsif Name'Length > 4
1457 Name (Name'First .. Name'First + 3) = "ada."
1460 ("user-defined descendents of package Ada " &
1462 Sloc (Unit (Comp_Unit_Node)));
1464 elsif Name'Length > 11
1466 Name (Name'First .. Name'First + 10) = "interfaces."
1469 ("user-defined descendents of package Interfaces " &
1471 Sloc (Unit (Comp_Unit_Node)));
1473 elsif Name'Length > 7
1474 and then Name (Name'First .. Name'First + 6) = "system."
1475 and then Name /= "system.rpc"
1478 or else Name (Name'First .. Name'First + 10) /=
1482 ("user-defined descendents of package System " &
1484 Sloc (Unit (Comp_Unit_Node)));
1490 -- All done if at end of file
1492 exit when Token = Tok_EOF;
1494 -- If we are not at an end of file, it means we are in syntax
1495 -- check only mode, and we keep the loop going to parse all
1496 -- remaining units in the file.
1500 Restore_Opt_Config_Switches (Save_Config_Switches);
1503 -- Now that we have completely parsed the source file, we can complete
1504 -- the source file table entry.
1506 Complete_Source_File_Entry;
1508 -- An internal error check, the scope stack should now be empty
1510 pragma Assert (Scope.Last = 0);
1512 -- Here we make the SCO table entries for the main unit
1514 if Generate_SCO then
1515 SCO_Record (Main_Unit);
1518 -- Remaining steps are to create implicit label declarations and to load
1519 -- required subsidiary sources. These steps are required only if we are
1520 -- doing semantic checking.
1522 if Operating_Mode /= Check_Syntax or else Debug_Flag_F then
1527 -- Restore settings of switches saved on entry
1529 Restore_Opt_Config_Switches (Save_Config_Switches);
1530 Set_Comes_From_Source_Default (False);
1531 Compiler_State := Analyzing;