Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with code-generation
Search options answers only
not deleted
user 755
Questions about the parts of a compiler that select assembly instructions or machine code specific to a specific target computer architecture.
2
votes
Accepted
Can algorithms of arbitrarily worse complexity be systematically created?
Yes, of course. $2^{f(n)}$ is asymptotically larger than $f(n)$, so you can come up with an unending sequence of larger and larger running times.
The answer to your other questions are also yes, by …
- 29.6k
2
votes
Is it possible to define branches which, once taken once, will become the default forever?
Unroll the loop. Instead of
while true:
switch on var:
1 => branch1
2 => branch2
default => branch3
replace that with an unrolled version:
while true:
switch on var:
1 => bran …
D.W.♦
- 166k
0
votes
How to generate (Java) source code in academically acceptable way - using abstract syntax tree?
There is no such thing as "academically acceptable" or "academically correct". That's not a thing.
Rather, what matters is whether you make a significant, novel contribution, and whether you adequat …
D.W.♦
- 166k
3
votes
Is there a described algorithm converting _from_ Continuation Passing Style?
The transformation to CPS style converts from
r = foo_direct(...);
bar(r);
to
foo_cps(..., bar);
If you want to go backwards, I think the following works. In CPS, every function call will have …
D.W.♦
- 166k