Programming Languages, Paradigms and Translators flashcards
152 flashcard decks by 116 users · Page 1 of 4
This GoConqr page gathers over 100 flashcard resources on programming languages, paradigms and translators, from language generations to compilation. School students and university students can practise terms and concepts, while teachers can find ready-made material. The decks cover both school and university levels. Pick a deck to start revising.
Select topic
- History of Programming Languages11
- Programming Language Types and Generations106
- Comparing and Choosing Programming Languages13
- Programming Paradigms23
- Variables, Functions and Scope9
- Functional Programming and Haskell38
- Haskell Modules and Libraries48
- Data Types and Typeclasses43
- Compilers, Interpreters and Assemblers81
- Stages of Compilation33
- Integrated Development Environments90
- Formal Languages and Grammars8
- Automata and Computability25
Flashcards
-
22 cardsGenerations of Programming Languages Name the first generation
-
18 cardsFunctional Programming Keywords Functional Programming Paradigm
-
22 cardsStages Of Compilation what is meant by a lexicon?
-
117 cardsOOP Langs Test 2 part b
-
133 cards449 midterm
-
94 cardsOrganization of Programming Langs Chapter 12 What are the 3 major language features of OOP Languages?
-
80 cardsSCC 312 - Languages and Compilation what is sentential form in phase grammars?
-
71 cardsOrganization of Programming Languages Chapter 1 Reasons for studying concepts of programming Languages
-
55 cardsTheory of Computation Flashcards FINISHED define a recursive routine
-
14 cardsAutomata Finite state machines: * Input is a string * String is processed one symbol at a time, left to right * outp...
-
24 cardsWhat is Computer Software? Briefly (and not too precisely) explain the difference between an algorithm and a program. Suppose we have ...
-
43 cards312 - Terminology What is a formal language?
-
39 cardsPLC notes What is a SAFE programming language?
-
40 cardsOrganization of Programming Languages Chapter 11 This is a view or representation of an entity that includes only the most significant attributes
-
41 cardsComparative Programming What is meant by alpha-equivalence?
-
36 cardsSCC 312 Define an alphabet
-
36 cardsTopic 4 | Theory of Computation What is the definition of a "State Machine"?
-
28 cardsSemantic Analysis Regular Expressions use in Compilers...
-
37 cardsStandard Prelude Definitions Decide if a character is a lower-case
-
30 cardsSemester Test 1 What are the Language Evaluation Criteria?
-
33 cards01 Handout 01 expresses a set of detailed instructions or standard form of commands, containing unique keywords and synta...
-
26 cardsProgramming language translators The function of a programming language translator
-
25 cardsCH1 : Gems - Now how to define a language and how to specify an algorithm to recognize them
-
17 cardsCompilers Lectures 1-6 Questions (not thorough) Give examples of some kind of checks that semantic analysis does.
-
15 cards2) What is computer software? Explain the difference between an algorithm and a program
-
24 cardsSemester Test 2 How is looping and iteration handled in purely functional languages?
-
37 cardsCMPT 340 (T/F) Programs are collections of functions?
-
29 cardsOOP langs Test 2 part a
-
17 cardsInformal Definitions - Theory of Computing Context Free Grammar (informal)
-
12 cardsUntitled Briefly explain what Russell’s Paradox is.
-
34 cardsF453 Computing - Function and Purpose of Translators Flash cards to support the assessment of OCR F453 Computing - The Purpose and function of translators
-
31 cardsOOP - Programming Paradigms What is a Programming Paradigm?
-
14 cardsLanguage Evaluation Criteria Why study programming languages?
-
29 cardsProgramming Languages - Chapter 5
-
10 cardsInfluences on Language Design von Neumann Architecture
-
15 cardsOOP What is a paradigm?
-
22 cardsLIMITS OF COMPUTATION What makes a programming language an acceptable choice for effective procedures?
-
20 cards10. Principles of Programming
-
32 cards1.2.4 Types of programming language
-
8 cardsTheory of Programming What is one example of a lack of orthogonality in the design of C?
More Programming Languages, Paradigms and Translators resources
About programming languages, paradigms and translators flashcards
GoConqr OriginalProgramming Languages, Paradigms and Translators flashcards
These decks offer questions and definitions on language generations, programming paradigms and translators. Generations of Programming Languages asks about different generations and whether they need a translator. Functional Programming Keywords covers terms such as higher order functions and function composition.
Choose a deck for your topic
Start with Generations of Programming Languages if you want to review language levels and translators. For compilation practice, the deck on its stages asks about lexical analysis. Semantic Analysis and Code Generation offer related material for further study.
Work through a deck, then return to the cards whose answers were difficult to recall. If you want a visual overview, switch to a mind map on the unit page. A quiz can give you another way to check what you remember. Choose a topic and try its flashcards.
Frequently asked questions
Which flashcards should I start with?
Start with Generations of Programming Languages if you want to review language generations and their translators. For a specific topic, Functional Programming Keywords covers terms such as function composition and higher order functions. The deck on compilation stages is another option for practising questions on lexical analysis.
Are these flashcards free to use?
Yes. Every resource listed here is free to open and study, with no account needed. The decks were made by GoConqr users, not by GoConqr. A free account can save quiz scores and also lets you make your own flashcards, quizzes, mind maps and notes.
Which levels do these flashcards suit?
The page includes material for school and university study. School students can find resources associated with GCSE Computer Science, A-level Computer Science and A-level Computing. University students can use decks on topics such as semantic analysis, code generation and automata to review their terminology.