Grammar Representation -. Structures

The aim of grammatical inference is to leam models of languages from sample sentences in these languages. A sentence can be any structured composition of primitive elements or symbols, though the most common type of composition is concatenation. So we infer grammar and the corresponding representation is an automaton. 

We have defined above what we mean by structures, the ordinary line notation used by organic chemists wherein we rely on a string representation with branching indicated by parenthesization. The reader will recall that context free grammars allow more complicated nested productions, e.g. S aSb than are allowed for by regular productions. Consider grammar 3 below ... 

In Figure 1 the first row of boxes indicates the overall concepts which the user must keep in mind an interface implemented as a pair of pre- and post-processors performs the translation between the product data representations in CAD systems and the neutral file. The second row represents the formal specification contained in this book the neutral file grammar which is specified in BNF productions, the semantical interpretation of a neutral file (defined as a finite state machine) in order to build a data structure which is compatible with the reference model specified. The last row shall indicate that validity of a neutral file requires conformance with the grammar, validity of the post-processor requires conformance with the semantic specification, and finally that CAD system data base contents can... 

---