, though we are rather fond of them for obvious reasons.
Submitted by benabik on Tue, 06/07/2011 - 19:19
This has been a bit of an eventful week outside of GSoC. I had another housemate move in, so I'm surrounded by boxes and keep getting asked to move this or fix something around the house. But progress has been made:
June 6 PAST::Node in NQP: Conversion of PAST::Node and it's seven subclasses into full NQP code.
Submitted by rohit_nsit08 on Tue, 06/07/2011 - 18:41
hmm... done with the parser and AST part. learned the use of
Quite interesting to see how Jison can make help in parsing languages.
Will start work on code generator this week, and implement basic features.
repository for the project will be CorellaScript
Looking forward to lots of coding.
Submitted by soh_cah_toa on Sun, 06/05/2011 - 04:00
While I feel like I got a lot of work done today, this past week was unfortunately much like the last: frustrating. Implementing breakpoints has turned out to be a lot more...interesting...than I had expected. And to what do I owe this great frustration? Why IMCC of course! For those of you who are unfamiliar with this, IMCC stands for "I Make Coders Cry."
A very simple algorithm for creating a breakpoint would look like this:
1. User enters command
2. Store line number 12 somehwere
3. Run code
Submitted by bubaflub on Sat, 06/04/2011 - 06:34
Step 1 for my project involved reading GMP.h and generating an NCI definition file from that. I've tweaked a few settings in the unimaginatively named "gmph2ncidef.pl" script that does that and refactored some common parts out in to YAML configuration files. This generates a PIR source file that gives us access to the GMP library functions.
Submitted by benabik on Tue, 05/31/2011 - 18:05
Today will be very brief. I'm a bit tired as my holiday weekend was very busy.
May 30 PAST NQP Framework: Convert PAST into NQP-based files via Q:PIR constructs. This will involve splitting Node.pir into separate files for each class, providing a NQP structure for each sub and updating the build framework.
As I noted a while back, I did this in the first couple of days of work. I'm now into the process of hunting down Q:PIR blocks and replacing them with NQP (using pir:: where needed).
Submitted by bubaflub on Tue, 05/31/2011 - 03:01
I've just finished step one of the project: minimally parsing the header gmp.h and generating an NCI definition file that is readable by the script ncidef2pir.pl. I'd definitely like to refactor this script into separate modules (with tests and docs) and make it usable for the larger community, but for now it suffices for the project.
Submitted by bubaflub on Sun, 05/29/2011 - 04:56
Good evening fellow parroters,
My blog posts will become increasingly technical as time goes on and if you're not into that kind of thing, then TL; DR - I'm working on it.
Still here? Good.
The main idea behind my project is to get usable bindings for GMP integer functions into Parrot. The GMP library is a good choice because it is free (as in beer and as in speech), stable, actively developed for 20 years, and generally fast: there are all kinds of optimizations for different architectures and compilers that there is absolutely no reason we should re-invent the wheel.
Submitted by soh_cah_toa on Sun, 05/29/2011 - 02:55
Since joining the Parrot development team, I've been forced to forget just about everything I thought I ever knew about stack machines, computer architecture, and especially control flow. In fact, I think a more appropriate slogan for Parrot would be "the antithesis of tradition." This is not necessarily a bad thing though. If it weren't for Parrot, I probably would never have heard of things like continuation passing style or mark and sweep garbage collection systems.
Submitted by lucian on Thu, 05/26/2011 - 19:09
Sadly, exams have proven to take up more time than expected. Today's exam was ok, easier than I expected. Also easier than previous exams from this lecturer. At least my last exam is on Wednesday, so after that I'm free.
I have however managed to do some investigative work.