{'fraction_non_alphanumeric': 0.022939677145284623, 'fraction_numerical': 0.0016992353440951572, 'mean_word_length': 4.919597989949748, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A W-Grammar Description for ADA.

Abstract : This thesis explores the formal definition of the syntax and static semantics of the Ada programming language. Several notational forms were compared and the particular notational form chosen is a double level grammar called the W-grammar. W-grammars were first used in the formal definition of Algol 68. Two W-grammars are presented. The first W-grammar is a translation of the modified BNF notation used in the Ada Language Reference Manual, and the second demonstrates the description of Ada's static semantics in W-grammar format. In the author's opinion, the W-grammars fall short of this goal since they are less readable than BNF for determining Ada's syntax, and experience shows that programmers most often refer to references to answer questions about syntax. However, a W-grammar description of Ada is still useful to computer scientists who need more than a simple understanding of the syntax and rudimentary description of the semantics. A formal semanatic definition of Ada is needed by system designers for multiple targets, by compiler designers, and by individuals needing formal correctness proofs of Ada programs.