Compilers

NAVIGATION

Reducible flow graphs

Hi,My SSA-based analysis would require a reducible flow graph, but instead ofconverting irreducible graphs to reducible at the front end (like inhttp://www.sable.mcgill.ca/~), I'd like to dothe conversion directly on SSA.I really like the simplicity of Erosa and Hendren's method Has an...

0 answers | 435 bytes |

Ignorance Showing...

[disclaimer]I'll admit right up front that I'm just now starting to play with CCtools and reading various theories / positions within the field. Myactual interest is because I'm a researcher in language acquisition andI keep finding myself comparing how I learned to program over t...

0 answers | 2289 bytes |

UCSD Pascal I.5 sources available at UCSD

Members of the Yahoo group devoted to UCSD Pascal(David Barto is the person to thank for that)have convinced UCSD to publish the sources of UCSD Pascal I.4 and I.5.The sources contain the complete set of sources compiler, operatingsystem, editor, linker, librarian Pascal and interpreter assemble...

0 answers | 930 bytes |

Recursive decent parsing - problem with two particular productions.

Hello everyone,I have these two troublesome production that if completed will finishmy parsing module. But I have no idea how to proceed with these twoparticular productions. I am parsing the scheme grammar(R5RS) using asimple recursive decent technique. Here are the productions. (fromR5RS)<c...

1 answers | 1419 bytes |

top down parsing

Are binary trees used in top down parsers? If so, what do they usefor insertion? A key? Something else? This is important because mytree api for a binary tree needs to make insertions as it goes downthe call stack while parsing. In order for it to insert into a tree,it needs to find the proper p...

0 answers | 1051 bytes |

ANN: LispKit GNU Pascal Port

LispKit has been ported to the GNU Pascal Compiler :-There are Windows and Linux executables availiable.Aaron...

0 answers | 144 bytes |

Implementing Just-In-Time Compilation

[Redirected from comp.lang.c++]Hello,I am in the planning process for developing a VM (Virtual Machine). Ihave been researching various aspects for developing a VM in C++ for a(semi...)dynamic language, and am looking at the possibility ofimplementing JIT for the VM. This VM will run on differen...

0 answers | 706 bytes |

Compiler positions available for week ending February 19

This is a digest of ``help wanted'' and ``position available'' messagesreceived at comp.compilers during the preceding week. Messages mustadvertise a position having something to do with compilers and must alsoconform to the guidelines periodically posted in misc.jobs.offered...

1 answers | 3388 bytes |

Learn a new foreign language easily

I will teach you how to learn any language you desire, in your ownhome, with minimal effort, and in absolutely the quickest amount oftime possible , just a matter of months, even if you have failedpreviously to learn a language or completely doubt your abilities toever do so....

0 answers | 311 bytes |

predictive parsing

I am running into an issue with my LL(1) parserin representing some of the nonterminals.The problem is this:suppose that I have the following grammar:start: A BA: C | C A | D | D AB: '*'C: '!' | '@'D: 'X' | 'Y'Where A, B, C, D are nonterminalstha...

2 answers | 946 bytes |

Computation of FIRST set

Hello NG,I have a big problem with ANTLR and the computation of the first set ofa rule. I've already read corresponing articles on the computation ofthe first set but additionally want to ask you.In the lexer I define a token ID : ('a''z'); and in the parser I havethe fo...

1 answers | 714 bytes |

whats wrong with analysizing pointers this way ?

Hi,Consider the following pointer analysis assuming the completeavailability of the source code.I consider pointers pointing to a universe of variables whoseaddress is taken, that includes variables that has been passed asparameters to functions, parameters whose address has been taken insidetha...

3 answers | 981 bytes |