Compilers

NAVIGATION

Heap pointers

Hi,I am looking for simple ways to detect if for a pointerdereference, the particular pointer is heap pointer or otherwise. Iknow doing this at compile time is the whole world of alias analaysiswhich is still a big research topic. What I am instead looking for issimple, low cost, heuristics whic...

5 answers | 922 bytes |

Reliable Software Technologies, Ada-Europe 2006: EXTENDED DEADLINE

Considering the requests of several potential contributors, and to giveall authors the same opportunity of further refining their submission,we announce that the submission deadline will be extended by one week,until November 6, 2005.EXTENDED DEADLINE11th International Conference onReliable Soft...

0 answers | 1347 bytes |

can we find the optimization level from obj-file?

Hi All,This is regarding the assembly level optimization .Is it possible tofind out from the object code to what level it is optimized .i.e. fore.g. in gcc compiler we have several level of optimizations so if oncethe compiler performs the optimization both architecture specific andnon-architect...

1 answers | 884 bytes |

Harmonia 3.0 program analysis toolkit released

Professor Susan L. Graham and the members of the Harmonia ResearchGroup at the University of California, Berkeley, announce the thirdrelease of Harmonia-Mode and the first source code release of theHarmonia program analysis toolkit.* Harmonia-Mode is an XEmacs plug-in that provides language-base...

0 answers | 2161 bytes |

ANN: phc 0.1, framework for processing PHP

Hi,A friend and myself are attempting to build a compiler for PHP, thatwill compile PHP code into native i86/Linux assembly code. As part ofthis project, we have developed- an abstract grammar for PHP,- a C++ class structure for this abstract grammar,- a parser that takes any PHP script and retu...

0 answers | 876 bytes |

Why context-free?

# Wouldn't it be possible to combine the advantages of an LL grammar with# the power of two-level grammars? As I understand it (if I do at all) a# VWG can be viewed as a finite specification of an infinite CFG. So I# would assume, given a string to parse, you would generate as much of the#...

0 answers | 3833 bytes |

Compiler positions available for week ending October 23

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...

0 answers | 3782 bytes |

terminological problem (EBNF & regular expressions)

LRgen allows one to do it like this: [X|Y|Z]/','>It seems like one would have to say>>((X|Y|Z)(,(X|Y|Z))*)?>>to accomplish the same thing.>Yes, if an X or Y or Z has to follow the last comma. I could not findthe description of the '/'-operator on your web-s...

0 answers | 428 bytes |

from INDIA: Compiler vs. Translator

Well, I have developed a Part Compiler (Part Translator) for my ownlanguage 'Astra'. The task of building it (still underdevelopment) was similar to that of a compiler for it doessyntax error checking, macro substitution, actual translation to Ccode, and now it has started executing so...

0 answers | 1010 bytes |

FINAL CFP, Reliable Software Technologies, Ada-Europe 2006

FINAL Call for Papers11th International Conference onReliable Software Technologies - Ada-Europe 20065 - 9 June 2006, Porto, Portugal DEADLINE Sunday 30 CTBERThe 11th International Conference on Reliable SoftwareTechnologies (Ada-Europe 2006) will take place in Porto,Portugal. Following the usua...

0 answers | 1080 bytes |

LRgen 6.0 Trial Version

LRgen 6.0 Standard Version is now available in a 30-day trial version.It offers the following:* SLR(1) Parsers.* SLR(1) Lexers.* 4-Matrix Parser Tables.* TBNF Grammar Notation.* Generates code in C++ language, andothers via a parser skeleton concept.* Some working grammars.There is a professiona...

0 answers | 1389 bytes |

Using Flex and Bison

Hi there everyone.I am fairly new to programming compilers, although not to programmingin general.I downloaded Parser Generator () whichis simply an IDE for Lex and YACC.I was just wondering, which way is the best to work on a compiler. Workon the Lex file first, then the YACC file, and compile?...

4 answers | 676 bytes |