|
|
1.1 ! root 1: .pa 1 ! 2: .he 'YACC (VI)'1/20/73'YACC (VI)' ! 3: .ti 0 ! 4: NAME yacc -- yet another compiler compiler ! 5: .sp ! 6: .ti 0 ! 7: SYNOPSIS _____________/crp/scj/yacc [ <grammar ] ! 8: .sp ! 9: .ti 0 ! 10: DESCRIPTION Yacc converts a context-free grammar into a set of ! 11: tables for a simple automaton which executes an LR(1) parsing ! 12: algorithm. ! 13: The tables are provided in readable form on the standard output ! 14: and in b-compiler format on file actn.b; the program ! 15: /crp/scj/bpar.b will parse strings using the actn.b file. ! 16: .sp ! 17: If your grammar is too big for yacc, you may ! 18: try /crp/scj/bigyacc, ! 19: some of whose size limits are ! 20: larger, and others smaller. ! 21: .sp ! 22: .ti 0 ! 23: FILES actn.b output tables ! 24: .br ! 25: actn.tmp temporary storage ! 26: .br ! 27: Note that these files are created in the invoker's ! 28: directory. ! 29: The file actn.tmp is only created by /crp/scj/bigyacc ! 30: (see above). ! 31: .sp ! 32: .ti 0 ! 33: SEE ALSO Yacc manual, by scj (available from ek); ! 34: "LR Parsing", by A. V. Aho and S. C. Johnson, to be published. ! 35: .sp ! 36: .ti 0 ! 37: DIAGNOSTICS There are various diagnostics, but only ! 38: one can be obtained in each run. ! 39: .sp ! 40: .ti 0 ! 41: BUGS The maximum number of terminal and non-terminal symbols ! 42: is 50 each, and this is not checked. There are ! 43: undoubtedly other bugs too.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.