Hi,
I read the #parrotsketch log from today. I cannot join the IRC now. The
Graph based Register allocation is good for statically compiled languages
like C. The real value of Graph Based allocation comes when you have limited
number of registers and have to spill some of the variables to
Hi,
I need to have a shared lib for a Dynamic PMC. The shared lib is generated
from my own code. What is a good location to place the shared lib that I
generate?
Is lib/blib a good location?
This is for Byte Code generator.
--
Thanks,
Vishal
Hi,
Can some one help me with Flex debugging?
Previously if I recall correctly the adding %option debug in imcc.l use
to spit out debug information to the console. This does not seem to work
now.
Am I doing something wrong?
-Vishal
On Mon, 2006-07-17 at 14:49 -0700, Allison Randal wrote:
re2c and lemon aren't enough of an improvement over flex and bison to be
worth the pain of rewriting IMCC from scratch. If we do create a new way
of producing bytecode (and it's a safe bet that we will at some point),
I would lean
Let's go for an agile, iterative approach to the spec. Write up some
initial thoughts on the shape of the API and post them to
parrot-porters. The group can do sanity-checking/brainstorming, and then
you can start a prototype based on the result. After we've played with
the prototype a
Hi,
I have been working on trying to make reenterant and/or thread-safe. There
are couple of things that have come up which might make it difficult to make
the existing implemention thread-safe/re-entrant.
The current implementation is implemented using Flex and YACC. Flex
implementation has
feedback.
--
Thanks,
Vishal
On 7/16/06, Vishal Soni [EMAIL PROTECTED] wrote:
Hi,
I have been working on trying to make reenterant and/or thread-safe. There
are couple of things that have come up which might make it difficult to make
the existing implemention thread-safe/re-entrant
PARROT_API void *Parrot_compile_file(Parrot_Interp interpreter,char
*fullname, String **error);
I like this interface, except for the return value from Parrot_compile_file.
Are there other options, such as returning a Sub PMC?
Chip and I have had a chat about other possible API's
, this is a very useful start; I think it could
be updated quite quickly. Thanks!
Pm
On 10 Jul 2006, at 20:47, Patrick R. Michaud wrote:
On Sun, Jul 09, 2006 at 04:11:55PM -0700, chromatic wrote:
On Sunday 09 July 2006 02:15, Vishal Soni wrote:
I am not an expert on which approach is the way
Thanks Chris
I looked at it but it does not implement Unicode in PGE and Optok too..
On Mon, 2006-07-10 at 23:30 -0500, Chris Dolan wrote:
On Jul 10, 2006, at 4:31 PM, Vishal Soni wrote:
This is is a good starting point. I have been writing the
JavaScript grammar
in PGE fromECMA-262
the second option. Because it might hinder your and other
language development. This might become a bigger issue as you start
writing bigger programs or libraries.
Let me know your thoughts.
-Vishal
On Mon, 2006-07-10 at 22:11 -0700, Matt Diephouse wrote:
Vishal Soni [EMAIL PROTECTED] wrote:
Hi
thing to borrow for any Parrot based Javascript implementation.
Regards,
Norman Nunley
On 7 Jul 2006, at 17:34, Vishal Soni wrote:
Hi,
Is any one working on Java Script(ECMA-262) implementation in Parrot?
--
Thanks,
Vishal
Hi Matt,
This patch is because the number of .constant decls in IMCC is limited
to 4096. This is a todo to make this dynamic. The evil code seems to
have about 4200 .constant decls being generated.
Here is the patch to fix it. For now I bumped up the limit to 8192 and
it works. But this is a
Hi,
I would like to throw a Parrot Exception from IMCC to the calling
program instead of terminating IMCC when a parse error occurs.
Are there some example in Parrot as to how to throw a Parrot exception
and how to catch it?
-Vishal
Hi,
Is any one working on Java Script(ECMA-262) implementation in Parrot?
--
Thanks,
Vishal
- 1;
+i-line = line ;
add_namespace(interp, unit);
return i;
}
On 7/3/06, Vishal Soni [EMAIL PROTECTED] wrote:
Will,
Did we get this one in?
-Vishal
On 6/30/06, Vishal Soni [EMAIL PROTECTED] wrote:
Hi,
The .end seems to be replaced by an implicit end.
-Vishal
On 6/29/06
. There are other lesser style issues WRT spacing and
braces, but they're easy to deal with.
The main thing is to get the algorithm solid, and the rest can be dealt with
later (before the patch is applied, though :-)).
On Sun, Jul 02, 2006 at 02:02:34PM -0500, Vishal Soni wrote:
This patch implements
@@=cut
*/+#define MAX_REGISTER 256INTVALintval_mod(INTVAL i2, INTVAL i3)@@ -678,12 +679,29 @@TODO add a define, if it's implemented so that we can start filling the gaps+TODO The current implementation will not work for following cases
++1. I0-I1 I1-I0 I0-I3+2. I1-I2 I3-I2++Vishal Soni=cut*//* proto TODO
Will,
Did we get this one in?
-Vishal
On 6/30/06, Vishal Soni [EMAIL PROTECTED] wrote:
Hi,
The .end seems to be replaced by an implicit end.
-Vishal
On 6/29/06, Will Coleda via RT [EMAIL PROTECTED] wrote:
Hey, Vishal:
[vsoni - Tue Jun 27 05:48:27 2006]:
Hi
]++N: Vishal Soni
+E: [EMAIL PROTECTED]+D: Bug fixes in IMCCIndex: compilers/imcc/optimizer.c===--- compilers/imcc/optimizer.c (revision 13046)
+++ compilers/imcc/optimizer.c (working copy)@@ -932,7 +932,7 @@ } /* this was screwing up
Hi,
The .end seems to be replaced by an implicit end.
-Vishal
On 6/29/06, Will Coleda via RT [EMAIL PROTECTED] wrote:
Hey, Vishal:
[vsoni - Tue Jun 27 05:48:27 2006]:
Hi,
This was a straight forward fix. The line number was being decremented
at the start of a 'sub' token imcc.y.
Hi Everyone,
Currently IMCC uses a Graph Coloring based Register allocation algorithm.
The implementation is a trimmed down version of Brigg's Allocator.
I came across this research paper that talks about the new register
allocation algorithm Linear Scan Allocationfor dynamically compiled
Hi Chip,
I have been looking at the Parrot code for last couple of weeks. While going
through the code there were a few things that striked me. There are quite a
few places where #ifdef constructs were used to define platform specific
code (#ifdef WIN32).
I was thinking would it make sense to
Hi,
Is Parrot IO going to be implemented via opcodes or PMC?
I looked at some old email discussion. There were discussions on refactoring
some IO opcodes to PMC's (e.g socket opcodes). Have we reached on any
decisions as to how we are going to implement the Parrot IO?
--
Thanks,
Vishal
Hi Leo,
So do we need to change os.pmc to leverage this infrastructure and get rid
of the platform specific code( currently implemented via IFDEF) from os.pmc?
-Vishal
On 6/19/06, Leopold Toetsch [EMAIL PROTECTED] wrote:
On Jun 18, 2006, at 2:02, Vishal Soni via RT wrote:
I am just
Hi,
I am trying implement #38146 todo item. While looking at the code for
os.pmc there are IFDEF constructs defined for different operating
systems (For e.g. WIN32 for now).
I am just wonedring if it would make sense to seperate out code for each
supported operating system under a directory
Hi,
I am trying implement #38146 todo item. While looking at the code for
os.pmc there are IFDEF constructs defined for different operating
systems (For e.g. WIN32 for now).
I am just wonedring if it would make sense to seperate out code for each
supported operating system under a directory
27 matches
Mail list logo