The Expression
Parser Step
3
Now the parser has looked in the current machine and project
to
find the templates and the matrices contained in the expression and
it shows a tree called Complete Tree, because the
items in the
tree are described with name and package.
For each template and matrix in the entered expression:
- If one and only one template or matrix
with the given name has been found, the whole name-package is written
in the tree.
- If no template or
matrix with the given name has been found, you get an error:
Template
with name xxxxx not found
or
Matrix with name
xxxxx not
found
Once the
complete tree is correct, you can
press the Next button.
The parser checks
that
the
expression is semantically correct. You get an error if:
- one of the templates has 0
or more than one output matrices
- the
number of input matrices
assigned to a template in the expression is not correct
- the
number of input parameters
assigned to a template in the expression is not correct.
- the
type of an input or output matrix
of a template in the expression is wrong (e.g. a text matrix instead of
a numeric one).
- the
type of a parameter of a
template in the expression is wrong (e.g. a number is expected but the
text in the expression cannot be converted to a number).
Also, if the output
matrix of a
template in the expression is ANY, the actual type is requested through
the matrix
type dialog.
If everything is right you can go to
step 4.
