WebSVN – tendra.SVN – Diff – /trunk/src/utilities/sid/grammar.c

+/*
+ * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 3. Neither the name of The TenDRA Project nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific, prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
+ * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
+ * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * $Id$
+ */
 /*
     		 Crown Copyright (c) 1997
     This TenDRA(r) Computer Program is subject to Copyright
     owned by the United Kingdom Secretary of State for Defence
     acting through the Defence Evaluation and Research Agency
     (DERA).  It is made available to Recipients with a
     royalty-free licence for its use, reproduction, transfer
     to other parties and amendment for any purpose not excluding
     product development provided that any such use et cetera
     shall be deemed to be acceptance of the following conditions:-
         (1) Its Recipients shall ensure that this Notice is
         reproduced upon any copies or amended versions of it;
         (2) Any amended version of it shall be clearly marked to
         show both the nature of and the organisation responsible
         for the relevant amendment or amendments;
         (3) Its onward transfer from a recipient to another
         party shall be deemed to be that party's acceptance of
         these conditions;
         (4) DERA gives no warranty or assurance as to its
         quality or suitability for any purpose and DERA accepts
         no liability whatsoever in relation to any use to which
         it may be put.
 */
  *	``grammar_factor''
+ *
  * This function applies the ``rule_factor'' function to all of the rules in
  * the grammar.  The function does a number of transformations on the rules to
  * make them more likely to be LL(1).  See the file "rule-factor.c" for more
  * details.
  *
  *	``grammar_simplify''
+ *
  * This function calls the ``rule_remove_duplicates'' function on the grammar,
  * to remove any rules that have identical form.  See the file "rule-simp.c"
  * for more details.
+ *
 #include "type.h"
 /*--------------------------------------------------------------------------*/
 static void
-grammar_trace_ignored PROTO_N ((entry, gclosure))
+grammar_trace_ignored(EntryP entry, GenericP gclosure)
-		      PROTO_T (EntryP   entry X
-			       GenericP gclosure)
+{
-    UNUSED (gclosure);
+    UNUSED(gclosure);
-    if (entry_is_basic (entry)) {
+    if (entry_is_basic(entry)) {
-	BasicP basic = entry_get_basic (entry);
+	BasicP basic = entry_get_basic(entry);
-	if (basic_get_ignored (basic)) {
+	if (basic_get_ignored(basic)) {
-	    entry_iter (entry, TRUE,
+	    entry_iter(entry, TRUE,
-			NIL (void (*) PROTO_S ((EntryP, GenericP))),
+			NIL(void(*)(EntryP, GenericP)), NIL(GenericP));
-			NIL (GenericP));
+	}
+    }
+}
 static void
-grammar_check_1 PROTO_N ((entry, gclosure))
+grammar_check_1(EntryP entry, GenericP gclosure)
-		PROTO_T (EntryP   entry X
-			 GenericP gclosure)
+{
-    UNUSED (gclosure);
+    UNUSED(gclosure);
-    switch (entry_type (entry)) EXHAUSTIVE {
+    switch (entry_type(entry))EXHAUSTIVE {
       case ET_RULE:
-	if (!rule_is_defined (entry_get_rule (entry))) {
+	if (!rule_is_defined(entry_get_rule(entry))) {
-	    E_rule_not_defined (entry_key (entry));
+	    E_rule_not_defined(entry_key(entry));
+	}
-	if (!entry_is_traced (entry)) {
+	if (!entry_is_traced(entry)) {
-	    E_rule_not_used (entry_key (entry));
+	    E_rule_not_used(entry_key(entry));
+	}
 	break;
       case ET_BASIC:
-	if (!entry_is_traced (entry)) {
+	if (!entry_is_traced(entry)) {
-	    E_basic_not_used (entry_key (entry));
+	    E_basic_not_used(entry_key(entry));
+	}
 	break;
       case ET_ACTION:
-	if (!entry_is_traced (entry)) {
+	if (!entry_is_traced(entry)) {
-	    E_action_not_used (entry_key (entry));
+	    E_action_not_used(entry_key(entry));
+	}
 	break;
       case ET_TYPE:
-	if (!entry_is_traced (entry)) {
+	if (!entry_is_traced(entry)) {
-	    E_type_not_used (entry_key (entry));
+	    E_type_not_used(entry_key(entry));
 	}
 	break;
       case ET_NON_LOCAL:
-	if (!entry_is_traced (entry)) {
+	if (!entry_is_traced(entry)) {
-	    E_non_local_not_used (entry_key (entry));
+	    E_non_local_not_used(entry_key(entry));
 	}
 	break;
       case ET_NAME:
       case ET_RENAME:
 	break;
       case ET_PREDICATE:
 	UNREACHED;
     }
 }
 static void
-grammar_find_cycles PROTO_N ((grammar, type))
+grammar_find_cycles(GrammarP grammar, CycleTypeT type)
-		    PROTO_T (GrammarP   grammar X
-			     CycleTypeT type)
 {
-    TableP     table         = grammar_table (grammar);
+    TableP     table         = grammar_table(grammar);
-    EntryP     predicate_id  = grammar_get_predicate_id (grammar);
+    EntryP     predicate_id  = grammar_get_predicate_id(grammar);
-    RuleP      dfs_list_head = NIL (RuleP);
+    RuleP      dfs_list_head = NIL(RuleP);
     RuleListT  root_list;
     RuleP      rule;
-    rule_list_init (&root_list);
+    rule_list_init(&root_list);
-    table_iter (table, rule_build_root_list, (GenericP) &root_list);
+    table_iter(table, rule_build_root_list, (GenericP)&root_list);
-    rule_list_terminate (&root_list);
+    rule_list_terminate(&root_list);
-    for (rule = rule_list_head (&root_list); rule;
+    for (rule = rule_list_head(&root_list); rule;
-	 rule = rule_next_in_root_list (rule)) {
+	 rule = rule_next_in_root_list(rule)) {
-	rule_compute_reverse_list (rule, type);
+	rule_compute_reverse_list(rule, type);
-	rule_compute_dfs (rule, type, &dfs_list_head);
+	rule_compute_dfs(rule, type, &dfs_list_head);
     }
-    for (rule = rule_list_head (&root_list); rule;
+    for (rule = rule_list_head(&root_list); rule;
-	 rule = rule_next_in_root_list (rule)) {
+	 rule = rule_next_in_root_list(rule)) {
-	rule_set_dfs_state (rule, DFS_UNTRACED);
+	rule_set_dfs_state(rule, DFS_UNTRACED);
     }
-    for (rule = dfs_list_head; rule; rule = rule_get_next_in_dfs (rule)) {
+    for (rule = dfs_list_head; rule; rule = rule_get_next_in_dfs(rule)) {
-	if (!rule_has_no_cycles (rule)) {
+	if (!rule_has_no_cycles(rule)) {
-	    RuleP reverse_dfs_list_head = NIL (RuleP);
+	    RuleP reverse_dfs_list_head = NIL(RuleP);
-	    rule_compute_reverse_dfs (rule, rule, &reverse_dfs_list_head);
+	    rule_compute_reverse_dfs(rule, rule, &reverse_dfs_list_head);
 	    if (reverse_dfs_list_head) {
-		switch (type) EXHAUSTIVE {
+		switch (type)EXHAUSTIVE {
 		  case CT_LEFT:
-		    rule_remove_left_cycle (reverse_dfs_list_head,
+		    rule_remove_left_cycle(reverse_dfs_list_head,
 					    predicate_id, table);
 		    break;
 		  case CT_TAIL:
-		    rule_handle_tails (reverse_dfs_list_head);
+		    rule_handle_tails(reverse_dfs_list_head);
 		    break;
 		  case CT_ALL:
-		    rule_handle_need_functions (reverse_dfs_list_head);
+		    rule_handle_need_functions(reverse_dfs_list_head);
 		    break;
 		  case CT_MUTATE:
 		    UNREACHED;
+		}
+	    }
+	}
     }
-    for (rule = rule_list_head (&root_list); rule;
+    for (rule = rule_list_head(&root_list); rule;
-	 rule = rule_next_in_root_list (rule)) {
+	 rule = rule_next_in_root_list(rule)) {
-	rule_reinit_reverse_list (rule);
+	rule_reinit_reverse_list(rule);
+    }
+}
 static void
-write_grammar_1 PROTO_N ((entry, gclosure))
+write_grammar_1(EntryP entry, GenericP gclosure)
-		PROTO_T (EntryP   entry X
-			 GenericP gclosure)
 {
-    OStreamP ostream = (OStreamP) gclosure;
+    OStreamP ostream = (OStreamP)gclosure;
-    if (entry_is_rule (entry)) {
+    if (entry_is_rule(entry)) {
-	write_rule (ostream, entry_get_rule (entry));
+	write_rule(ostream, entry_get_rule(entry));
-	write_newline (ostream);
+	write_newline(ostream);
     }
+}
 /*--------------------------------------------------------------------------*/
 void
-grammar_init PROTO_N ((grammar))
+grammar_init(GrammarP grammar)
-	     PROTO_T (GrammarP grammar)
+{
-    TableP table = grammar_table (grammar);
+    TableP table = grammar_table(grammar);
-    table_init (table);
+    table_init(table);
-    entry_list_init (grammar_entry_list (grammar));
+    entry_list_init(grammar_entry_list(grammar));
     grammar->terminal       = 0;
-    grammar->predicate_type = NIL (EntryP);
+    grammar->predicate_type = NIL(EntryP);
-    grammar->predicate_id   = table_add_generated_name (table);
+    grammar->predicate_id   = table_add_generated_name(table);
+}
 #ifdef FS_FAST
 #undef grammar_table
 #endif /* defined (FS_FAST) */
 TableP
-grammar_table PROTO_N ((grammar))
+grammar_table(GrammarP grammar)
-	      PROTO_T (GrammarP grammar)
+{
-    return (&(grammar->table));
+    return(&(grammar->table));
+}
 #ifdef FS_FAST
-#define grammar_table(g) (&((g)->table))
+#define grammar_table(g)	(&((g)->table))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef grammar_entry_list
 #endif /* defined (FS_FAST) */
 EntryListP
-grammar_entry_list PROTO_N ((grammar))
+grammar_entry_list(GrammarP grammar)
-		   PROTO_T (GrammarP grammar)
+{
-    return (&(grammar->entry_list));
+    return(&(grammar->entry_list));
+}
 #ifdef FS_FAST
-#define grammar_entry_list(g) (&((g)->entry_list))
+#define grammar_entry_list(g)	(&((g)->entry_list))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef grammar_max_terminal
 #endif /* defined (FS_FAST) */
 unsigned
-grammar_max_terminal PROTO_N ((grammar))
+grammar_max_terminal(GrammarP grammar)
-		     PROTO_T (GrammarP grammar)
+{
-    return (grammar->terminal);
+    return(grammar->terminal);
+}
 #ifdef FS_FAST
-#define grammar_max_terminal(g) ((g)->terminal)
+#define grammar_max_terminal(g)	((g)->terminal)
 #endif /* defined (FS_FAST) */
 unsigned
-grammar_next_terminal PROTO_N ((grammar))
+grammar_next_terminal(GrammarP grammar)
-		      PROTO_T (GrammarP grammar)
+{
     if (grammar->terminal == UINT_MAX) {
-	E_too_many_terminals ();
+	E_too_many_terminals();
 	UNREACHED;
+    }
-    return (grammar->terminal ++);
+    return(grammar->terminal++);
+}
 #ifdef FS_FAST
 #undef grammar_get_predicate_type
 #endif /* defined (FS_FAST) */
 EntryP
-grammar_get_predicate_type PROTO_N ((grammar))
+grammar_get_predicate_type(GrammarP grammar)
-			   PROTO_T (GrammarP grammar)
+{
-    return (grammar->predicate_type);
+    return(grammar->predicate_type);
+}
 #ifdef FS_FAST
-#define grammar_get_predicate_type(g) ((g)->predicate_type)
+#define grammar_get_predicate_type(g)	((g)->predicate_type)
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef grammar_set_predicate_type
 #endif /* defined (FS_FAST) */
 void
-grammar_set_predicate_type PROTO_N ((grammar, type))
+grammar_set_predicate_type(GrammarP grammar, EntryP type)
-			   PROTO_T (GrammarP grammar X
-				    EntryP   type)
+{
     grammar->predicate_type = type;
+}
 #ifdef FS_FAST
-#define grammar_set_predicate_type(g, t) ((g)->predicate_type = (t))
+#define grammar_set_predicate_type(g, t)	((g)->predicate_type = (t))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef grammar_get_predicate_id
 #endif /* defined (FS_FAST) */
 EntryP
-grammar_get_predicate_id PROTO_N ((grammar))
+grammar_get_predicate_id(GrammarP grammar)
-			 PROTO_T (GrammarP grammar)
+{
-    return (grammar->predicate_id);
+    return(grammar->predicate_id);
+}
 #ifdef FS_FAST
-#define grammar_get_predicate_id(g) ((g)->predicate_id)
+#define grammar_get_predicate_id(g)	((g)->predicate_id)
 #endif /* defined (FS_FAST) */
 void
-grammar_check_complete PROTO_N ((grammar))
+grammar_check_complete(GrammarP grammar)
-		       PROTO_T (GrammarP grammar)
 {
-    TableP     table      = grammar_table (grammar);
+    TableP     table      = grammar_table(grammar);
-    EntryListP entry_list = grammar_entry_list (grammar);
+    EntryListP entry_list = grammar_entry_list(grammar);
-    table_untrace (table);
+    table_untrace(table);
-    entry_list_iter_table (entry_list, TRUE,
+    entry_list_iter_table(entry_list, TRUE, NIL(void(*)(EntryP, GenericP)),
-			   NIL (void (*) PROTO_S ((EntryP, GenericP))),
-			   NIL (GenericP));
+			  NIL(GenericP));
-    table_iter (table, grammar_trace_ignored, NIL (GenericP));
+    table_iter(table, grammar_trace_ignored, NIL(GenericP));
-    table_iter (table, grammar_check_1, NIL (GenericP));
+    table_iter(table, grammar_check_1, NIL(GenericP));
 }
 void
-grammar_remove_left_recursion PROTO_N ((grammar))
+grammar_remove_left_recursion(GrammarP grammar)
-			      PROTO_T (GrammarP grammar)
 {
-    grammar_find_cycles (grammar, CT_LEFT);
+    grammar_find_cycles(grammar, CT_LEFT);
 }
 void
-grammar_compute_first_sets PROTO_N ((grammar))
+grammar_compute_first_sets(GrammarP grammar)
-			   PROTO_T (GrammarP grammar)
 {
-    TableP table = grammar_table (grammar);
+    TableP table = grammar_table(grammar);
-    table_iter (table, rule_compute_first_set, NIL (GenericP));
+    table_iter(table, rule_compute_first_set, NIL(GenericP));
 }
 void
-grammar_factor PROTO_N ((grammar))
+grammar_factor(GrammarP grammar)
-	       PROTO_T (GrammarP grammar)
+{
-    TableP         table      = grammar_table (grammar);
+    TableP         table      = grammar_table(grammar);
-    EntryListP     entry_list = grammar_entry_list (grammar);
+    EntryListP     entry_list = grammar_entry_list(grammar);
     FactorClosureT closure;
-    bitvec_init (&(closure.bitvec1));
+    bitvec_init(&(closure.bitvec1));
-    bitvec_init (&(closure.bitvec2));
+    bitvec_init(&(closure.bitvec2));
     closure.table        = table;
-    closure.predicate_id = grammar_get_predicate_id (grammar);
+    closure.predicate_id = grammar_get_predicate_id(grammar);
-    table_untrace (table);
+    table_untrace(table);
-    entry_list_iter_table (entry_list, FALSE, rule_factor,
+    entry_list_iter_table(entry_list, FALSE, rule_factor, (GenericP)&closure);
-			   (GenericP) &closure);
-    table_unlink_untraced_rules (table);
+    table_unlink_untraced_rules(table);
-    bitvec_destroy (&(closure.bitvec1));
+    bitvec_destroy(&(closure.bitvec1));
-    bitvec_destroy (&(closure.bitvec2));
+    bitvec_destroy(&(closure.bitvec2));
 }
 void
-grammar_simplify PROTO_N ((grammar))
+grammar_simplify(GrammarP grammar)
-		 PROTO_T (GrammarP grammar)
 {
-    TableP       table        = grammar_table (grammar);
+    TableP       table        = grammar_table(grammar);
-    EntryListP   entry_list   = grammar_entry_list (grammar);
+    EntryListP   entry_list   = grammar_entry_list(grammar);
-    EntryP       predicate_id = grammar_get_predicate_id (grammar);
+    EntryP       predicate_id = grammar_get_predicate_id(grammar);
-    rule_remove_duplicates (table, predicate_id);
+    rule_remove_duplicates(table, predicate_id);
-    table_untrace (table);
+    table_untrace(table);
-    entry_list_iter_table (entry_list, FALSE,
+    entry_list_iter_table(entry_list, FALSE, NIL(void(*)(EntryP, GenericP)),
-			   NIL (void (*) PROTO_S ((EntryP, GenericP))),
-			   NIL (GenericP));
+			  NIL(GenericP));
-    table_unlink_untraced_rules (table);
+    table_unlink_untraced_rules(table);
 }
 void
-grammar_compute_inlining PROTO_N ((grammar))
+grammar_compute_inlining(GrammarP grammar)
-			 PROTO_T (GrammarP grammar)
 {
-    TableP     table         = grammar_table (grammar);
+    TableP     table         = grammar_table(grammar);
-    if (rule_get_inline_tail_calls ()) {
+    if (rule_get_inline_tail_calls()) {
-	grammar_find_cycles (grammar, CT_TAIL);
+	grammar_find_cycles(grammar, CT_TAIL);
     }
-    table_iter (table, rule_compute_all_basics, NIL (GenericP));
+    table_iter(table, rule_compute_all_basics, NIL(GenericP));
-    table_iter (table, rule_compute_inlining, NIL (GenericP));
+    table_iter(table, rule_compute_inlining, NIL(GenericP));
-    table_iter (table, rule_compute_needed_functions, NIL (GenericP));
+    table_iter(table, rule_compute_needed_functions, NIL(GenericP));
-    grammar_find_cycles (grammar, CT_ALL);
+    grammar_find_cycles(grammar, CT_ALL);
 }
 void
-grammar_check_collisions PROTO_N ((grammar))
+grammar_check_collisions(GrammarP grammar)
-			 PROTO_T (GrammarP grammar)
 {
-    TableP table = grammar_table (grammar);
+    TableP table = grammar_table(grammar);
-    table_iter (table, rule_check_first_set, (GenericP) grammar);
+    table_iter(table, rule_check_first_set, (GenericP)grammar);
-    table_iter (table, rule_compute_follow_set, (GenericP) grammar);
+    table_iter(table, rule_compute_follow_set, (GenericP)grammar);
-    table_iter (table, rule_compute_see_through_alt, NIL (GenericP));
+    table_iter(table, rule_compute_see_through_alt, NIL(GenericP));
-    table_iter (table, rule_compute_alt_first_sets, NIL (GenericP));
+    table_iter(table, rule_compute_alt_first_sets, NIL(GenericP));
 }
 void
-grammar_recompute_alt_names PROTO_N ((grammar))
+grammar_recompute_alt_names(GrammarP grammar)
-			    PROTO_T (GrammarP grammar)
+{
-    TableP table        = grammar_table (grammar);
+    TableP table        = grammar_table(grammar);
-    EntryP predicate_id = grammar_get_predicate_id (grammar);
+    EntryP predicate_id = grammar_get_predicate_id(grammar);
-    table_iter (table, rule_recompute_alt_names, (GenericP) predicate_id);
+    table_iter(table, rule_recompute_alt_names, (GenericP)predicate_id);
+}
 void
-grammar_compute_mutations PROTO_N ((grammar))
+grammar_compute_mutations(GrammarP grammar)
-			  PROTO_T (GrammarP grammar)
+{
-    TableP    table = grammar_table (grammar);
+    TableP    table = grammar_table(grammar);
     RuleListT root_list;
     RuleP     rule;
-    rule_list_init (&root_list);
+    rule_list_init(&root_list);
-    table_iter (table, rule_build_root_list, (GenericP) &root_list);
+    table_iter(table, rule_build_root_list, (GenericP)&root_list);
-    rule_list_terminate (&root_list);
+    rule_list_terminate(&root_list);
-    for (rule = rule_list_head (&root_list); rule;
+    for (rule = rule_list_head(&root_list); rule;
-	 rule = rule_next_in_root_list (rule)) {
+	 rule = rule_next_in_root_list(rule)) {
-	rule_compute_reverse_list (rule, CT_MUTATE);
+	rule_compute_reverse_list(rule, CT_MUTATE);
+    }
+    table_iter(table, rule_compute_mutations, NIL(GenericP));
+    for (rule = rule_list_head(&root_list); rule;
+	 rule = rule_next_in_root_list(rule)) {
+	rule_reinit_reverse_list(rule);
+    }
-    table_iter (table, rule_compute_mutations, NIL (GenericP));
-    for (rule = rule_list_head (&root_list); rule;
-	 rule = rule_next_in_root_list (rule)) {
-	rule_reinit_reverse_list (rule);
-    }
+}
 void
-write_grammar PROTO_N ((ostream, grammar))
+write_grammar(OStreamP ostream, GrammarP grammar)
-	      PROTO_T (OStreamP ostream X
-		       GrammarP grammar)
+{
-    TableP     table      = grammar_table (grammar);
+    TableP     table      = grammar_table(grammar);
-    EntryListP entry_list = grammar_entry_list (grammar);
+    EntryListP entry_list = grammar_entry_list(grammar);
-    table_untrace (table);
+    table_untrace(table);
-    entry_list_iter_table (entry_list, FALSE, write_grammar_1,
+    entry_list_iter_table(entry_list, FALSE, write_grammar_1,
-			   (GenericP) ostream);
+			  (GenericP)ostream);
+}
 /*
  * Local variables(smf):
  * eval: (include::add-path-entry "../os-interface" "../library")

Subversion Repositories tendra.SVN

(root)/trunk/src/utilities/sid/grammar.c – Rev 2 → 7