Sonoma State University
Department of Computer Science
CS-460: Programming Languages
Exercise 3a: Creating a Concrete Syntax Tree.

Objective:

In a team of three or four students, convert the input program (below) into a series of tokens then place each token in an LCRS (left-child, right-sibling) binary tree. There should be one token per tree node. The program below is defined by our C-like programming programming language.

How do I know what a token is?

Please use the BNF document for the C-like programming language. Since this is an in-class exercise, please ask me questions if you need any help.

Please use the following input program to create your Concrete Syntax Tree:

procedure fizzbuzz (int counter)
{
  int state;

  state = 0;
  if ((counter % 3) == 0)
  {
    state = 1;
  }
  if ((counter % 5) == 0)
  {
    state = state * 2 + 2;
  }
  if (state == 1)
  {
    printf ("Fizz");
  }
  else
  {
    if (state == 2)
    {
      printf ("Buzz");
    }
    else
    {
      if (state == 4)
      {
        printf ("Fizzbuzz");
      }
      else
      {
        printf ("%d", counter);
      }
    }
  }
}

procedure main (void)
{
  int counter;

  counter = 1;
  while (counter <= 100)
  {
    fizzbuzz (counter);
    counter = counter + 1;
    if (counter <= 100)
    {
      printf (", ");
    }
    else
    {
      printf ("\n");
    }
  }
}

Submission Instructions:

Since this is a group assignment, please write the names of each member of the team student on your assignment submission along with "Exercise 3a: Creating a Concrete Syntax Tree".

Exercise 3a Rubric

CRITERIA RATINGS POINTS
Tokenization Proficient
10 points
A partial or complete list of tokens is listed in a Left-Child, Right-Sibling binary tree which is relevant to the assignment guidelines above.		 Below Expectation
0 points
No solution submitted.		 10 points
Total points: 10