Newborn

CS 326 - Test 1 - improved background for choosing programming languages - increased ability to express ideas - increased ability to learn new languages - better understanding of the significance of implementation - overall advancement of computing - answersFive reasons for studying concepts of programming languages Scientific applications - large number of floating point calcs Business applications - produce reports, use decimal numbers and chars Artificial Intelligence - Symbols rathe...

cs-326 quizlet with questions and answers

CS 326 Study guide - answersA = B * C + (A * C) <assign> → <id> = <expr> <id> → A | B | C <expr> → <id> + <expr> | <id> * <expr> | ( <expr>) | <id> - answersAssuming dynamic scoping, what is the value of y in function sub2 for both calling sequences? function big() { function sub1() { var x = 7; sub2(); } function sub2() { var y = x; var z = 3; } var x = 3; sub2(); } - answersCreate a Parse Tree with th...

CS 326 Questions False - answersRegular expressions are used to describe the syntactic structure of a language, while context-free grammars are used to describe its lexical structure. False - answersThere's a one-to-one correspondence between instructions in assembly language and instructions in a high-level language. False - answersIn C, the variable x that appears in void f() {int x;...} is allocated statically. True - answersScheme belongs to the class of declarative programming lang...

CS 326 - final exam e = expression f = factor start -> e ';' e -> e +/- f | f f -> f */ / atom | atom atom -> string | int "Bob" / 26 ; //could be valid string if you want it to be it is syntactically valid but semantically drugs. - answersGenerate a Grammar that is Syntactically Valid, but show an input string that would not type check. (test question from subprograms slide part 2) Conversion between primitive types and the corresponding wrapper classes is a...

CS 326 Final Exam finite automata: chars go into a lexer to make tokens CFG/PDA: tokens go into parser to make AST these then do other stuff - answersWhat is the lexer parser diagram? Any arbitrary program fed to, lets call an analyzer, can it, with infinite memory and speed, determine if the arbitrary program will stop sometime in the future? - answersWhat is the halting problem? Symmetry in language design. - answersWhat is orthogonality? statically typed and dynamically typed. - answer...

CS 326 Operating Systems Test 1 Dr. Howell What were the items built during the first Computer generation? - answersVacuum tubes, Plugboards (No operating system) What were the items built during the second Computer generation? - answersTransistors, Punch cards, Batch Systems What were the items built during the third Computer generation? - answersIntegrated Circuits, multiprogramming, One Family Concept (IBM 360), OS/360 spooling, time sharing, multics, unics, unix, File security and pr...

CS 326 Final False - answersType coercion is an explicit (specified by the programmer) conversion from a value of one type to a value of another type. True - answersDisplays allow accessing a non-local variable in constant time, while static chains require dereferencing an arbitrary number of pointers. True - answersIn C++, modifying headers of private member functions in a class requires to recompile all files that use the class, but never to rewrite them. False - answersIn C++, modifyin...

CS 326 Final − Syntax and semantics − Naming, scopes and bindings − Control flow − Data types − Subroutines - answersGeneral issues in the design and implementation of a language: Mechanism for defining types (syntax, semantics) − Rules for: − type equivalence (when are the types of two values the same?) − type compatibility (when can a value of type A be used in a context that expects type B?) − type inference (what is the type of an expression, given the types of t...

CS 326 Exam 1 1. Write-ability/Express-ability 2. Readability 3. Simplicity 4. Reliability 5. Efficiency 6. Portable 7. Reusable Code 8. Popular - answersQualities of a good PL - answers5 Type Checks that are not done in C++ Statements that execute differently should look different - answersDef: Regularity of Syntax Program that does the translation from HLPL to LLPL before the program is run - answersDef: Compiler Program that does the translation step at run time - answersDef: Int...