Index of /~lloyd/tildeProgLang/C/Tree

[ICO]NameLast modifiedSizeDescription

[PARENTDIR]Parent Directory  -  
[TXT]BFirst.c2017-02-21 14:03 940  
[TXT]Infix.c2017-02-21 14:03 295  
[TXT]Insert.c2017-02-21 14:03 1.0K 
[TXT]Ops.c2017-02-21 14:03 519  
[TXT]Parser.c2017-02-21 14:03 3.2K 
[TXT]Parser.h2017-02-21 14:03 196  
[TXT]Postfix.c2017-02-21 14:03 566  
[TXT]Prefix.c2017-02-21 14:03 300  
[TXT]Queue.h2017-02-21 14:03 208  
[TXT]QueueElement.h2017-02-21 14:03 170  
[TXT]QueueOps.c2017-02-21 14:03 1.2K 
[TXT]Tree.h2017-02-21 14:03 162  
[TXT]TreeElement.h2017-02-21 14:03 246  
[TXT]Write.c2017-02-21 14:03 849  
[TXT]driverParser.c2017-02-21 14:03 506  
[TXT]driverSortTree2017-02-21 14:03 774  

[C] [A+DS] [Tree]   [Parsing] in [Java] [SML]


An easy way to compile and run: Copy all `.c' and `.h' files into a clean Unix/Linux directory (folder). Compile by gcc *.c     Then run by ./a.out

Procedure Formal Parameters

Some of the procedures in this directory have procedure formal parameters, i.e. parameters that are themselves procedures such as process below:

   void infix(Tree T, void process(TreeElementType))
   /* NB. process is a procedure formal parameter. */
    { if( T != NULL )
       { infix( T->left, process );
         infix( T->right, process );
   /* Infix Tree Traversal. */

infix traverses a Tree in infix order and carries out some process operation on each Tree Element. A process operation must be provided as a procedure actual parameter when infix is called, just as some Tree actual parameter must be provided for the Tree formal parameter T. The actual parameters are substituted for the formal parameters when infix is called. e.g.

   void PrintElt(TreeElementType e) { printf("%s ", e); }


   infix(someTree, PrintElt);      /* call infix */
   /* PrintElt is the procedure actual parameter */

infix can be called with many different actual parameters. Procedure parameters are implemented, by the compiler, as pointers to the code of routines.

Procedure formal parameters are particularly useful in the parser.

© L.Allison, 1999, 2000, 2003,