New answers tagged programming-languages
0
votes
Results of a Program After Call By Reference Vs. Call By Value-Result
Just to clean up some confusion: What you call “call by reference” was “call by name” in Algol. In newer languages, “call by reference” will take the address of an object and the function accesses the ...
1
vote
Guess the output of a c program
Just to make it tidy.
int main() {
int a, i = 4;
int z = 5;
a = --i + --i + --z;
printf("%d %d", a, i);
return 0;
}
As gnasher729 ...
1
vote
Explanation of a simple example of how an interaction net computes?
Interaction nets are a form of graph rewriting. Nets are graphs made up of some finite number of labelled nodes with connections between them. If two nodes have the same label then they have the ...
0
votes
What is a safe programming language?
Take this C code:
int* p;
*p = 1;
C is a very unsafe language. p is uninitialised, so it could point anywhere. Likely effects are an immediate crash, overwriting ...
1
vote
In the simulation of a C-program by a Turing machine, how does a TM determine which instruction to execute?
They aren't trying to show that there is a single Turing machine that can run every C program (although that's also true). They're trying to show that for every C program, there is some Turing machine ...
1
vote
In the simulation of a C-program by a Turing machine, how does a TM determine which instruction to execute?
The tape of the TM stores the code of the program (the sequence of machine instructions), followed by the memory of the program. You design a TM that traverses back and forth between the code section ...

D.W.♦
- 156k
Top 50 recent answers are included
Related Tags
programming-languages × 980type-theory × 118
compilers × 94
functional-programming × 87
terminology × 74
semantics × 70
language-design × 50
object-oriented × 45
formal-languages × 41
lambda-calculus × 41
computability × 38
reference-request × 38
logic × 36
algorithms × 33
types-and-programming-languages × 33
turing-completeness × 31
type-checking × 31
formal-grammars × 28
history × 25
typing × 25
turing-machines × 23
syntax × 20
polymorphisms × 20
type-inference × 18
interpreters × 18