6.5. Syntax Graphs.   

As we did with our title-name specification, so too can we construct a syntax graph with rules that can be used to produce pseudo-code for a parser.

(1) A graph symbol for each non-terminal symbol A

            A::=  1|2|3|....n

     can be made depending on following rules.

     x in an i sequence corresponds to a recognising statement

     for this symbol.   Analyser can then advance to next symbol.

     This is a call to routine to analyse B.

     B in  an i sequence corresponds to

      A::=  1|2|3|....n  is a choice.

      i is constructed according to same rules given.

      A::=  123....n is a sequential approach.

        i    = {a}

  <expression>::=<simple expression> |

                 <simple expression><relational op><simple expression>


Use   S = <simple expression>           P = <sign>

      R = <relational operator>         F = <factor>

      T = <term>                        A = <adding operator>


M = <multiplying operator>


                expression::= S|SRS