Syntax/Semantic Language
(S/SL) A high level specification language for recursive descent parsers developed by J.R. Cordy and R.C. Holt at the University of Toronto in 1980. S/SL is a small language that supports cheap recursion and defines input, output, and error token names (& values), semantic mechanisms (class interfaces whose methods are really escapes to routines in a host programming language but allow good abstraction in the pseudo-code) and a pseudo-code program that defines the syntax of the input language by the token stream the program accepts. Alternation, control flow and one-symbol look-ahead constructs are part of the language. The S/SL processor compiles this pseudo-code into a table (byte-codes) that is interpreted by the S/SL table-walker (interpreter). The pseudo-code language processes the input language in recursive descent LL1 style but extensions allow it to process any LRk language relatively easily. S/SL is designed to provide excellent syntax error recovery and repair. It is more powerful and transparent than yacc but slower. S/SL has been used to implement production commercial compilers for languages such as PL/I, Euclid, Turing, Ada, and COBOL, as well as interpreters, {command processors}, and domain specific languages of many kinds. . ["Specification of S/SL: Syntax/Semantic Language", J.R. Cordy and R.C. Holt, Computer Systems Research Institute, University of Toronto, 1980]. ["An Introduction to S/SL: Syntax/Semantic Language", R.C. Holt, J.R. Cordy, and D.B. Wortman ACM Transactions on Programming Languages and Systems (TOPLAS), Vol 4, No. 2, April 1982, pp 149-178]. ["Hierarchic Syntax Error Repair", D.T. Barnard and R.C. Holt, International Journal of Computing and Information Sciences, Vol. 11, No. 4, August 1982, Pages 231-258.] (2003-10-30) In addition suitable contents:
[ 2 ] [ = ] [ @ ] [ abstraction ] [ accept ] [ ACM ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ AS ] [ as ] [ at ] [ B ] [ b ] [ be ] [ bo ] [ bs ] [ by ] [ byte ] [ byte-code ] [ C ] [ ca ] [ cat ] [ cc ] [ cell ] [ ch ] [ ci ] [ cl ] [ class ] [ CM ] [ co ] [ COBOL ] [ code ] [ codes ] [ com ] [ comma ] [ command ] [ compiler ] [ Computer ] [ con ] [ cons ] [ control ] [ control flow ] [ cu ] [ D ] [ de ] [ design ] [ do ] [ domain ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ era ] [ error ] [ es ] [ escape ] [ et ] [ Euclid ] [ extension ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gh ] [ gn ] [ gr ] [ gu ] [ h ] [ hat ] [ heap ] [ hose ] [ host ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ input ] [ int ] [ interface ] [ interpreted ] [ interpreter ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ ke ] [ ken ] [ ki ] [ la ] [ language ] [ Lex ] [ li ] [ lk ] [ LL ] [ lt ] [ lu ] [ ly ] [ M ] [ ma ] [ mall ] [ man ] [ method ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ np ] [ ns ] [ O ] [ om ] [ onto ] [ op ] [ output ] [ pa ] [ parent ] [ parser ] [ pe ] [ ph ] [ pl ] [ PL/I ] [ port ] [ pr ] [ process ] [ processor ] [ product ] [ program ] [ programming ] [ programming language ] [ pseudo ] [ pt ] [ query ] [ rc ] [ re ] [ real ] [ recursion ] [ recursive ] [ recursive descent parser ] [ rete ] [ rl ] [ ro ] [ routine ] [ ru ] [ S ] [ sa ] [ sc ] [ se ] [ si ] [ sig ] [ sit ] [ SL ] [ sl ] [ sm ] [ so ] [ Spec ] [ spec ] [ specification ] [ S/SL ] [ st ] [ stream ] [ struct ] [ su ] [ support ] [ sy ] [ syntax ] [ T ] [ table ] [ th ] [ tm ] [ to ] [ token ] [ TOP ] [ tp ] [ tr ] [ transparent ] [ Turing ] [ ua ] [ ug ] [ up ] [ us ] [ V ] [ va ] [ value ] [ ve ] [ vi ] [ walk ] [ yacc ] [ yt ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (10996 Reads) |
