Description: Design grammar class, to achieve grammar G [S] = (Vt, Vn, P, S) of document literacy grammar file representation and memory representation can be customized grammar is three set+1 symbols Key (difficulty) is a collection of production with a production structure, can be used to derive, is paying particular attention to areas such as reading and writing production agreement only set an example as follows (file contents): S-> a S-> aSb That is the first non-end symbol S is the start symbol, and then get inside the terminator analysis set = {a, b}, nonterminals set = {S}, production sets (omitted). Text grammar can be freely defined according to their needs, for example, direct yourself to give three sets.
To Search:
File list (Check if you may need any files):
test1.3.1.txt
Download