GoConqr has a new look! Let us know what you think.

Flashcards

OOP langs Test 2 part a

James Herd Organization of Programming Langs 2 English 29 cards

Cards in this deck (29)

  1. 1Syntax analyzers are either ____, meaning they construct leftmost derivations and a parse tree in top-down order, or ____, in which case they construct the reverse of a rightmost derivation and a parse tree in bottom-up order.top-down, bottom-up
  2. 2The top symbol on the LR parse stack is always a ____ symbol that represents all of the information in the parse stack that is relevant to the parsing process.State
  3. 3In _____________________, the binding of subscript ranges and storage allocation is dynamic and can change any number of times during the array's lifetime.Heap dynamic array
  4. 4Scripting languages such as Perl, JavaScript, Ruby, and PHP all provide built-in pattern matching operations based on __________________.Regular Expressions
  5. 5Which of the following is NOT a way to store negative numbers in computer's memory?Complex number notation
  6. 6______ refers to the region(s) of a program in which a variable is visibility, and thus can be used.Scope
  7. 7_____ parser is an LL parser that is implemented by writing code directly from the grammar of the source language. EBNF is ideal as the basis for this type of parsers and much easier and simpler to implement.Recursive-descent
  8. 8For CFG, parsers that work for all unambiguous grammars have complexity ______ in generalO(n^3)
  9. 9In ______________________, the length of a string can vary up to a declared and fixed maximum set by the variable's definition. (Example:Strings in C and "C-style" strings in C++)limited dynamic length
  10. 10Data types that are not defined in terms of other types are called ____________________primitive data types
  11. 11Assignment by cloning allocates new memory location, copies value of an existing variable, and binds to the new location(True/False)True
  12. 12Dangling references do not exist in garbage-collected languages because objects are only reclaimed when they are no longer accessible via an object reference (True/False)True
  13. 13A collection of the attributes of a variable is called ______________________Descriptors
  14. 14The type of attribute-name binding that occurs prior to execution is called ______________.Static binding
  15. 15A __________________ is a reference to an object was allocated on the heap but no longer exists.Dangling Pointers
  16. 16The time when an attribute is computed and associated with a name is called ___________________Binding Time
  17. 17A ____ parser is called a shift-reduce algorithm, because in most cases it either shifts the next lexeme of input onto the parse stack or reduces the handle that is on top of the stack.LR parser
  18. 18The ____ table in LR parser is used to determine which state symbol should be placed on the parse stack after a reduction has been done.Go-to table
  19. 19A slice of an array is a portion of the array such as a row or column, and it has the properties of a whole array. (True or False)True/False, Not really sure
  20. 20___________ is an important data structure created and maintained by compilers in order to store attribtes about the occurrence of various entities such as variable names.Symbol table
  21. 21_____ is normally based on a formal syntax description of the language being implemented.Syntax analysis
  22. 22Which of the following is true of floating point numbers?They model real numbers, but the floating-point representation of most real numbers is only an approximation
  23. 23Memory that has been allocated in the heap but can no longer be reached by any reference in a a program is called __________.Garbage
  24. 24____________ specifies a set of named constant values called elements or members.Enumeration
  25. 25A homogenous array is one in which the elements need not be of the same type. (True/False)False
  26. 26The prototype of a function describes the function’s input data but not the code to implement it. (True/False)True
  27. 27Some grammars that fail the pairwise disjointness test often can be modified to pass it, using ____.Left-factoring
  28. 28LR parsers use two parsing tables: action and ____.Go-to
  29. 29Every parser for a context-free programming language is a ____, because this is a recognizer for a context-free language.Push down Automata

Information

Description
2 Organization of Programming Langs Flashcards on OOP langs Test 2 part a, created by James Herd on 28/03/2019.
Created by
James Herd
Views
3
Rating

Feedback

What is it about?

What do you think of the new look?

How do you like it?