Compilers

NAVIGATION

syntax directed translation

Are syntax directed translation and syntax directed definitionsynonymous?My book has the title 'syntax directed translation' as a section titlein one of the chapters but in defining it, it uses 'syntax directeddefinition'Also, what are some real world examples of using syntax...

3 answers | 797 bytes |

LL(k) grammars for tests

Hi,I'm looking for some small LL(k) grammars for testing my parser generator.Also, grammars which are not LL(k) would be nice.It's not difficult to make examples by myself, but grammars not made bysoftware developer would be better for testing this software.TIABest regards,Michal Sliwk...

0 answers | 356 bytes |

Compiler positions available for week ending December 25

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 | 11478 bytes |

Genetic programming and code evolution

23 Dec 2005 20:54:18 -0500, G Rosset wrote:I would like to create a genetic algorithm to modify C/C++ and improveit for either speed or space or a combination of both.This would be quite similar to the tool called Critticall, seehttp://www.critticall.com/I am skeptical about the page, if not to...

1 answers | 3084 bytes |

Adjusting for local settings in an ANTLR application

Hello expertsMy team has implemented a ANTLR based language translator that emitsJava. But when someone in Japan tries to use it in their localsettings, it shows garbage on the console. What is it that we have todo to adjust to local settings ? For example, we want Japanese text togo into source...

0 answers | 474 bytes |

T diagrams in compilers

could anyone please tell me the 'bootstrapping' process in C andFRTRAN compilers , illustrated with T-diagrams?[The usual approach in recent decades is to write the compiler on anothercomputer, then once it works reasonably well use it to compile itself.But what's a T diagram? -Jo...

4 answers | 330 bytes |

How can I interface an interpreter to C code?

Hello,I just finished working through Essentials Programming Languages(first edition) and now know enough to write recursive descentinterpreters for simple languages. The book also explains how to createbytecode virtual machines. So far so good.I now wish to learn how to interface c code to the...

2 answers | 1629 bytes |

FoxPro 2.6 language specification

Hello, All !I need to FoxPro 2.6 for DS language specification. It can be at(E)BNF format. It's very desirable what it will be an officialversion. Where can I get it free?Thanks in advance, Eugene Nikolaevnev[at]online.nsk.su...

0 answers | 277 bytes |

Compiler positions available for week ending December 18

0 answers | 5315 bytes |

New open source parser generator: LLnextgen

LLnextgen is a (partial) reimplementation of the LLgen (*)Extended-LL(1) parser generator [http://www.cs.vu.nl/~ceriel/LLgen.html]created by D. Grune and C.J.H. Jacobs which is part of the AmsterdamCompiler Kit (ACK). It takes an EBNF-like description of the grammarwith associated semantic actio...

0 answers | 950 bytes |

How to use flex/bison with an inverted flow of control?

Hi All,I'm looking for a parser/scanner generator to use in a project I'mworking on (CGDB).The problem I'm having with bison/flex is that they expect you to haveall of the data up front before you call the parse routine. This is notgood for me, as it takes control away from the pr...

5 answers | 859 bytes |

detecting ambiguous grammars

Chris F Clark <cfc@world.std.comwrote:For the general class of CFLs, i.e. just an arbitrary grammar whoserules are not otherwise constrained, the answer is there is noalgorithm to determine whether the grammar is ambiguous orunambiguous.[]There are algorithms which can detectsubsets on one cl...

0 answers | 1855 bytes |