1) Set B is the finite set of all rules for a particular programming language.
2) Set A is the infinite set of all valid strings of that language and is defined by Set B.
I'm having a problem defining expressing that mathematically.
My so far unsuccessful idea:
- Define a set C - the set of all possible strings.
- set A is a finite union between infinite sets A_i such that for every rule B_i
$B_i ( C ) = A_i$
can It be defined with an implication ? for every rule B_i of B applied to every string c_i of C, if $B_i ( c_j ) \implies c_j$