Fichas
Programming Languages
Fichas del conjunto (10)
- 1Turing MachineReads and writes 0s and 1s. The language it accepts is the set of strings that leave it in an accepting state.
- 2How can formal languages be described?By using a set of rules (α → β) which describe the structure of the language.
Example:
expression → number
expression → expression + expression
... - 3Chomsky hierarchyType 0 - unrestricted grammar
Type 1 - context sensitive grammar
Type 2 - context-free grammar
Type 3 - regular grammar - 4CompilerTranslates program code into executable machine code
- 5InterpreterInterprets the program code directly without generating executable machien code
- 6Common elements of different programming languages
- 7True or false? Formally, all programm languages are differentFalse. They are formally equivalent. All of them have the power of turing machines (or Lambda calculus). But depending on the problem, one language may serve better than others.
- 8Imperative vs. functional programming languagesImperative: data + algorithms
Functional: stateless; functions pass values to each other - 9Object Oriented Programming (OOP)Objects send messages to each other
- 10Logic Programmingfacts + rules → new facts
Información
- Descripción
- Bachelor (Einführung in die Informatik) Informatik Fichas sobre Programming Languages, creado por Luca Rolshoven el 03/01/2017.
- Creado por
- Luca Rolshoven
- Visitas
- 4
- Valoración