Sonoma State University
Department of Computer Science
CS-460: Programming Languages
Exercise 3b: 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:

function int sum_of_first_n_squares (int n)
{
  int sum;

  sum = 0;
  if (n >= 1)
  {
    sum = n * (n + 1) * (2 * n + 1) / 6;
  }
  return sum;
}
  
procedure main (void)
{
  int n;
  int sum;

  n = 100;
  sum = sum_of_first_n_squares (n);
  printf ("sum of the squares of the first %d numbers = %d\n", n, sum);
}

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 3b: Creating a Concrete Syntax Tree".

Exercise 3b 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