![[Santa Clara University]](../images/top.gif){kind=small}
and Computer Science
|
||
|
Department of
Mathematics and Computer Science |
|
|
||
ACCEPT FA-7 ACTUAL PARAMETER 3-1 ADA P-1 ADA FG-3 ADA FG-4 ADA FA ALGEBRAIC NOTATION FOR LANGUAGES 6-18 ALGOL-68 2-12 ALGOL-68 P-1 ALGORITHMS FOR PARALLEL MACHINES LN-1 ALIASING 3-9 ALPHABET 2-4 ALTERNATE FSA'S RE-6 AMBIGUITY OF GRAMMARS 2-11 AMBIGUITY 6-29 APPLICATIVE LANGUAGES MSC-3 ARDEN'S THEOREM RE-8 AUTOMATA THEORY 6-6 AXIOMATIC SEMANTIC DEFINITION MSC-4 BINDING, DEEP/SHALLOW 4-3 BINDINGS OF VARIABLES 4 BNF 2 BNF - BACKUS-NAUR-FORM 2-8 BNF AND REGULAR EXPRESSIONS RE-3 BOUND VARIABLES LC-7 C FG-1 C FG-4 C FC C SYNTAX SUMMARY FC-6 CALL-BY-ADDRESS 3-6 CALL-BY-EXPRESSION 3-7 CALL-BY-NAME 3-7 CALL-BY-REFERENCE 3-6 CALL-BY-VALUE 3-3 CALL-BY-VALUE-RESULT 3-4 CFG, PROPER 6-28 CHARACTERS 2-4 CHOMSKY MA-1 CHOMSKY HIERARCHY 6-4 CHOMSKY LANGUAGES AND COMPUTER LANG 6-25 CLOSURE, KLEENE/POSITIVE 2-5 COBOL C COBOL ARRAYS (I.E. TABLES) C-29 COBOL COMPUTE C-13 COBOL CONFIGURATION SECTION C-8 COBOL CONTROL STRUCTURES C-36 COBOL DATA C-9 COBOL DATA DIVISION C-17 COBOL DISPLAY C-34 COBOL DIVISIONS C-4 COBOL ENVIRONMENT DIVISION C-8 COBOL FILE SECTION C-17 COBOL FILE DESCRIPTOR C-17 COBOL IDENTIFICATION DIVISION C-7 COBOL INPUT-OUTPUT SECTION C-8 COBOL INPUT/OUTPUT C-33 COBOL LEVEL NUMBERS C-19 COBOL METALANGUAGE C-3 COBOL MOVE C-13 COBOL MOVE/LEGAL C-16B COBOL PERFORM C-38 COBOL PICTURE C-21 COBOL PRAGMATICS C-41 COBOL PROCEDURE DIVISION C-32 COBOL RECORDS C-27 COBOL TABLES C-29 COBOL WORKING-STORAGE SECTION C-18 COERSION S-8 COMPILER MSC-3 COMPILER THEORY 6-10 COMPILING 6-14 COMPILING/PARSING 6-15 COMPOUND SAXPY LN-6 CONCATENATION OF STRING 2-5 CONCURRENT PASCAL P-2 CONTEXT FREE GRAMMAR 6-3 CONTEXT SENSITIVE GRAMMAR 6-3 CONVERSION RULES (RIGHT- TO LEFT-LIN) RE-13 CRAY P-1 CRAY LN-1 CYCLE-FREE 6-27 DATA ENCAPSULATION 5 DATA ENCAPSULATION (MODULES) FM-3 DEEP BINDING 4-3 DENOTATIONAL SEMANTIC DEFINITION MSC-4 DERIVATION 6-8 DERIVATION OF CONVERSION RULES RE-14 DERIVES 6-2 DEVOLUTIONAL SEMANTIC DEFINITION MSC-4 DICTIONARY 2-4 DIRECTLY DERIVES 6-2 DISAMBIGUATE 2-11 DISAMBIGUATE 6-31 DUMMY PARAMETER 3-1 EMPTY SET RE-1 EMPTY STRING 2-4 EMPTY STRING 6-4 EMPTY STRING LAMBDA RE-1 ENTRY (PATH-PASCAL) P-11 EXPORT CLAUSE (MODULA-2) 5-6 EXPORTING SUBPROGRAMS (PATH-PASCAL) P-11 EXTENDED BNF 2-10 FINITE STATE AUTOMATON 6-6 FORK P-1 FORMAL PARAMETER 3-1 FORTRAN F FORTRAN CARD FORMAT F-1 FORTRAN CARRIAGE CONTROL F-15 FORTRAN COMPLEX F-5 FORTRAN CONCATENATION F-7 FORTRAN DATA TYPES F-2 FORTRAN DATA STATEMENT F-3 FORTRAN DOUBLE PRECISION F-5 FORTRAN DO-LOOP F-8 FORTRAN DO-LOOP/ROCKET LOSS 2-1 FORTRAN FORMAT STATEMENT F-11 FORTRAN IF F-9 FORTRAN INPUT/OUTPUT F-11 FORTRAN OPERATORS F-6 FORTRAN PRAGMATICS F-22 FORTRAN STYLE F-20 FORTRAN SUBPROGRAMS F-16 FREE VARIABLES LC-8 FSA AND REGULAR GRAMMARS RE-5 FSA AND REGULAR SETS RE-8 FSA TO REGULAR EXPRESSION RE-10 FUNCTIONAL LANGUAGES MSC-3 FUNCTIONAL SEMANTIC DEFINITION MSC-4 FUTURE LANGUAGES FG GAUSSIAN ELIMINATION LN-4 GENEALOGY OF LANGUAGES 1-7 GLOBAL ENVIRONMENT 4-1 GRAMMAR 2-6 GRAMMAR, SIMPLE PRECEDENCE 6-15 GRAMMARS 6 HANDLE 6-15 IMPERATIVE LANGUAGES MSC-3 IMPORT CLAUSE (MODULA-2) 5-6 INITIALIZATION (PATH-PASCAL) P-11 INPUT SYMBOLS 6-6 INTERIOR NODE 6-9 INTERPRETER MSC-3 INTERPRETIVE SEMANTIC DEFINITION MSC-4 INTRODUCTION 1 INVISIBLE IDENTIFIERS 4-2 IV-TRAN P-1 JOIN P-1 KLEENE CLOSURE 2-5 L(G) 2-6 L-VALUE MSC-5 LABELED MARKOV ALGORITHMS MA-2 LABELED MARKOV ALGORITHMS MA-9 LAMBDA (EMPTY STRING) 2-4 LAMBDA CALCULUS L-3 LAMBDA CALCULUS LC LAMBDA CALCULUS SEMANTICS LC-7 LAMBDA EXPRESSION LC-1 LAMBDA EXPRESSION SYNTAX LC-3 LAMBDA-FREE 6-27 LAMBDA-PRODUCTIONS 6-26 LANGUAGE 2-4 LANGUAGE 6-1 LANGUAGE--FORMAL 2-3 LEFT RECURSIVE 6-27 LEFT-LINEAR GRAMMARS RE-12 LEFTMOST DERIVATION 6-8 LENGTH OF STRING 2-5 LEXEME 6-14 LINEAR PARALLEL PROBLEMS LN LINEAR SYSTEMS LN-1 LISP L LISP "PURE" L-34 LISP - FUNCTIONAL NOTATION L-3 LISP - GRAPHIC REPRESENTATION L-6 LISP - LAMBDA CALCULUS L-3 LISP - S-EXPRESSION L-5 LISP ASSOCIATION LIST L-38 LISP CAR L-6 LISP CDR L-6 LISP FUNCTIONS L-12 LISP INPUT/OUTPUT L-35 LISP LIST NOTATION L-8 LISP LIST OF AVAILABLE SPACE L-42 LISP LISTS L-7 LISP OBJECT LIST L-42 LISP PARAMETER PASSING L-33 LISP PRAGMATICS L-43 LISP PROG STATEMENT L-27 LISP PROPERTY LIST L-40 LISP USER-DEFINED FUNCTIONS L-23 LOCAL ENVIRONMENT 4-1 MARINER ROCKET LOSS 2-1 MARKOV ALGORITHMS MA MARKOV ALGORITHM HEADER MA-2 MISCELLANEOUS MSC MODULA-2 FG-2 MODULA-2 FG-4 MODULA-2 FM MODULE (DEFINITION) FM-3 MODULE (IMPLEMENTATION) FM-3 MODULES (MODULA-2) 5-1 NON-LOCAL ENVIRONMENT 4-1 NON-TERMINAL SYMBOLS 2-6 NON-TERMINALS 6-1 OBJECT (PATH-PASCAL) P-2 OBJECTS (PATH-PASCAL) 5-1 OPERATIONAL SEMANTIC DEFINITION MSC-4 PACKAGES (ADA) 5-1 PARALLEL PROGRAMMING P-12 PARALLELISM P-1 PARAMETER PASSING SCHEMA 3 PARIKH'S THEOREM 6-30 PARSE TREE 2-3 PARSE TREE 2-7 PARSE TREES 6-9 PATH EXPRESSIONS P-8 PATH-EXPRESSION (PATH-PASCAL) P-3 PATH-PASCAL P PHRASE 6-15 PHRASE STRUCTURE GRAMMAR 6-1 PHRASE STRUCTURE GRAMMAR 6-3 PHRASE-STRUCTURE GRAMMAR 2-6 PIPELINE MACHINES LN-2 POSITIVE CLOSURE 2-5 PRAGMATICS 1-1 PROCESS (PATH-PASCAL) P-2 PRODUCTION RULES 2-6 PRODUCTIONS 6-1 PRODUCTION RULES 6-2 PROPER CFG 6-28 PRUNING PARSE TREES 6-11 PSG 6-3 PUSH-DOWN AUTOMATON 6-7 R-VALUE MSC-5 RE-WRITE RULES 2-6 RECURSIVE 6-27 REFERENCING ENVIRONMENT 4-1 REGULAR EXPRESSIONS RE REGULAR GRAMMARS AND FSA RE-5 RENAMING RULE (LAMBDA CALCULUS) LC-8 REPLACEMENT RULE (LAMBDA CALCULUS) LC-7 RIGHT LINEAR GRAMMAR 6-3 RIGHT RECURSIVE 6-27 RIGHTMOST DERIVATION 6-8 ROOT 6-9 SAXPY LN-5 SCOPE, STATIC/DYNAMIC 4-6 SELECT FA-7 SELF-EMBEDDING 6-27 SEMANTIC DEFINITION MSC-4 SEMANTICS 1-1 SENTENCE 2-4 SENTENCE 2-6 SENTENCE 6-1 SENTENCE SYMBOL 2-6 SENTENTIAL FORM 2-6 SENTENTIAL FORM 6-1 SHALLOW BINDING 4-3 SIMPLE PHRASE 6-15 SIMPLE PRECEDENCE GRAMMARS 6-15 SINGLE CHARACTER RE-1 SNOBOL S SNOBOL <LABEL> S-4 SNOBOL ARRAY S-9 SNOBOL COMMENT S-4 SNOBOL CONTINUATION S-4 SNOBOL CONTROL STRUCTURES S-15 SNOBOL DATA TYPES S-7 SNOBOL FUNCTIONS S-23 SNOBOL GOTOS S-5 SNOBOL INPUT/OUTPUT S-29 SNOBOL LITERAL STRING S-6 SNOBOL OBJECT CODE S-32 SNOBOL OPERATORS S-13 SNOBOL PATTERN MATCHING S-17 SNOBOL PRAGMATICS S-33 SNOBOL SCANNING MODES S-22 SNOBOL SYNTAX/SEMANTICS S-3 SNOBOL TABLE DATA TYPE S-1 SNOBOL TABLE S-10 SNOBOL TRIM S-30 SNOBOL TYPE COERSION S-8 SNOBOL USER-DEFINED FUNCTIONS S-27 SNOBOL VALUE ASSIGNMENTS S-20 SNOBOL VALUE ASSIGNMENTS/IMMEDIATE S-31 STACK 6-7 START STATE 6-6 START SYMBOL 2-6 START SYMBOL 6-1 STATES 6-6 STATIFICATION 6-31 STRING 2-4 SUBSTITUTION OF VARIABLES (LAMBDA CAL) LC-5 SUBSTITUTION RULE (LAMBDA CALCULUS) LC-9 SUPER VECTOR SPEED LN-3 SUPER-COMPUTERS P-1 SYLLABUS FOR COURSE MSC-1 SYLLABUS FOR COURSE MSC-2 SYMBOLS 2-4 SYNTACTIC SUGAR FC-1 SYNTAX 1-1 SYNTAX--MORE FORMAL 2-1 TASK FA-7 TERMINAL SYMBOLS 2-6 TERMINAL STATES 6-6 TERMINALS 6-1 THUNK 3-7 TOWERS OF HANOI L-44 TRANSITION FUNCTION 6-6 TURING MACHINE 6-7 TYPE 0 GRAMMAR 6-3 TYPE 0 GRAMMAR 6-24 TYPE 0 LANGUAGES 6-26 TYPE 1 GRAMMAR 6-3 TYPE 1 LANGUAGE SAMPLE 6-22 TYPE 2 GRAMMAR 6-3 TYPE 2 LANGUAGE SAMPLE 6-21 TYPE 3 GRAMMAR 6-3 TYPE 3 LANGUAGE SAMPLE 6-19 TYPE 3 LANGUAGE SAMPLE 6-20 UNEXPECTED SHARING 5-4 USELESS SYMBOL 6-27 VARIABLES AND BINDINGS 4-1 VECTOR PIPELINE LN-2 VECTOR SPEED LN-3 VISIBILITY 4-5 VISIBLE IDENTIFIERS 4-2 VOCABULARY 2-4 WORDS 2-4
This page is maintained by Dennis C. Smolarski, S.J.
dsmolarski@math.scu.edu
Last updated: 12 April 2000. Minor updateing: 1 March 2002.