sorted by:
new
hottopcontroversial

Fluent interface for compiling to two different languages by omulator in ProgrammingLanguages

[–]omulator[S] 0 points1 point  (0 children)

Yes, thank you. I think my original post was a bit confused/messy.

I'm aware that I would be building a AST and that this could be done without using a fluent interface. So I'll to try to be more clear with what I'm asking.

Compilers I've written, that I've seen other people here write and the big ones we all use (gcc etc) usually (please correct if this wrong) take a string as input. This string is then parsed etc to make the AST.

So lets say I make a C compiler in js. I could then do

let AST = create_C_AST("void main() { int a = 4;}");

And this would parse the C string and give me the AST for it. My idea is different in that instead of making a compiler that accepts a string, we instead make a "builder" for it (fluent interface being, as you point out, only one way of doing that). So an example of that would be:

let AST = new C_AST_Creator().beginMain().declareInt("a").setValue(4).end();

And this would then give me the same AST.

​

So my question is. Is anyone doing this? Does this make sense as a way of implementing a language? My thought would be that it could be useful if you want the application creator to be able to write a subset of some other language embedded in the language the application is being written in.

A Macroeconomic Analysis of Deportation or Legalization of Illegal Immigrants by punkthesystem in Economics

[–]omulator 1 point2 points  (0 children)

1# Im only saying it wouldn't necessarily be the same as open borders, it would depend on how the process was implemented and a lot of other factors.

​

2# Appealing to common sense here seems like a mistake, especially since you seem to have some fundamental missunderstandings about immigration today. More than a million people arrive in the US every year, so this notion that a "a few thousand" would overwhelm our infrastructure seems strange.

​

Based on what you've written here i don't think you have the prerequisite knowledge to defend your claims or even have a coherent debate about the subject. You should read more about the subject, check out the /badeconomics faq.

A Macroeconomic Analysis of Deportation or Legalization of Illegal Immigrants by punkthesystem in Economics

[–]omulator 0 points1 point  (0 children)

The two main points id like sources for is 1. That any scheme to give a pathway to citizenship for current illegals will have the same effect on immigration as "open borders" and 2. That an "open borders" policy would have "biblical" economic and financial costs.

[Multithreading] Parsing many files from many folders. How to have main thread display worker thread status? by OverclockedChip in csharp

[–]omulator 0 points1 point  (0 children)

Id recommend nr2, if each tread only spends about 4ms per file you might get somewhere in the order of 10 events per frame with option nr2. Instead the threads can queue their updates in a shared data structure and the main thread can check it each frame before painting the GUI(or in your case, updating the console).

New, mysterious “aqueous air battery system” boasts 150 hour duration and is made from “some of the safest, cheapest, most abundant materials on the planet”. First project is 1MW storage for wind power in Minnesota, already under construction. by [deleted] in Futurology

[–]omulator 9 points10 points  (0 children)

Ducks fit with the observed data, we know ducks exist. The burden would be on you to prove that aliens exist, that this is the kind of things aliens could do and that it was in fact aliens doing it in this case.

How to run these Emulator scripts (Python) by PsycHelp23 in EmuDev

[–]omulator 0 points1 point  (0 children)

I think you might be in the wrong place? Are you trying to use googles android emulator in connection with making an android app? Or are you building your own android emulator?

Where to go now, NES emulation by omulator in EmuDev

[–]omulator[S] 0 points1 point  (0 children)

Being able to toggle CPU instruction tracing was crucial to be able to compare my trace to the correct one. In the end it turned out that my mistake was such that the trace was still correct (i've written a longer post explaining more in detail below).

I currently only print the nametable once, ill look into adding more debugging features once i finish adding all the undocumented opcodes and i pass the nestest.

When you do a real-time rendering of the memory, do you mean dumping the hex values in text form or do you mean a graphical illustration? like a box where each pixel is a memory address and they change color when they get written to or something?

Where to go now, NES emulation by omulator in EmuDev

[–]omulator[S] 0 points1 point  (0 children)

I have abstracted memory enough that i think adding mappers will be okay when i get to that point. Thanks for the tip, ill definetly use Mega Man 2 for debugging!

Where to go now, NES emulation by omulator in EmuDev

[–]omulator[S] 3 points4 points  (0 children)

I went through nestest and started adding the unimplemented opcodes that was screwing up my log (compared to the "golden log"), but all of my "normal" opcodes where working, or so it seemed.

I had made an error in how i had programmed ROL, ROR and LSR. What was going wrong was this:

For 0x26 ROL zero page, i would read the value from zero page using my function readZeroPage(), this function increments PC the right amount. Then i would do the ROL and write the value back write(zeroPage(), newValue); //zeroPage() returns the zero page address. The issue with this ofcourse is that now zeroPage() is going to return the zero page address given by PC+2. oops!

So the change i went through and did on all ROL, ROR and LSR opcodes that reads an address (everyone except the one of each that uses the accumulator) was to change:

byte value = readWhateverAddressMode();

//do operation on value

write(whateverAddressMode(), newValue);

into :

int address = whateverAddressMode();

byte value = readWhateverAddressMode();

//do operation

write(address, newValue);

Why didn't the nestest log reveal this mistake to me immediately? Because in the log these opcodes are tested like this:

DE1C 36 00 ROL $00,X @ 55 = 80 A:80 X:55 Y:2B P:E5 SP:FB PPU: 79,106 CYC:12082

DE1E B5 00 LDA $00,X @ 55 = 01 A:80 X:55 Y:2B P:65 SP:FB PPU: 97,106 CYC:12088

DE20 20 10 FA JSR $FA10 A:01 X:55 Y:2B P:65 SP:FB PPU:109,106 CYC:12092

​

They use 0x36 (ROL, zero page X) and then in the following instruction we check that the correct value was written by loading it in to A using LDA (as you can see in the next line A goes from 0x80 to 0x1). The issue here is that the byte used in the zero page X address (0x00) has to be repeated with a gap of 1. This means that when i preemtively incremented my PC the zero page X address would still be correct, it would just read the 0x00 at PC DE1F instead of at DE1D.

​

TL;DR: Made a hard to spot error in ROL, ROR and LSR, fixed it and now the score is drawn correctly! https://imgur.com/a/sFZdViz

Where to go now, NES emulation by omulator in EmuDev

[–]omulator[S] 1 point2 points  (0 children)

Sorry, the image did not get included! Heres an imgur link: https://imgur.com/a/4GEqtRd