[ Course Documents ] : [ Syntax ]

Previous Contents Next Keyword Index

Recursive Descent Example

• Example: For the grammar:

      <term> -> <factor> {(* | /) <factor>}
  

• Simple recursive descent parsing subprogram:

      void term() { 
          factor();  /* parse the first factor*/
          while (next_token == ast_code || 
                 next_token == slash_code) {
              lexical();  /* get next token */
              factor();  /* parse the next factor */
          }
      }