Search the web
Sign In
New User? Sign Up
compilers101 · Compilers 101
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
Messages 573 - 603 of 1320   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
573
Just curious if there was still anyone out there. Chris [Non-text portions of this message have been removed]...
Chris Cranford
chrisc062677
Offline Send Email
Sep 16, 2005
9:50 pm
574
If I define two regular-expression rules such as: "if" { return TT_IF; } [a-zA-Z]([a-zA-Z]|[0-9] { return TT_IDENTIFIER; } Then in my code I have something...
chris.cranford@...
chrisc062677
Offline Send Email
Sep 17, 2005
12:17 am
575
... Assuming this is a general question and not specific to yacc/lex ... there are two ways of combining lexers and parsers. The yacc/lex model is that you...
Graham Toal
graham_toal
Offline Send Email
Sep 17, 2005
5:34 am
576
... The Edinburgh Computer History Project has quite a few versions of the same basic parser as it was developed over the years, but this is about the earliest...
Graham Toal
graham_toal
Offline Send Email
Sep 17, 2005
6:15 am
577
... Not sure what lexer you're using, but FLex always returns the longest possible match. Cheers, -- M. Uli Kusterer http://www.zathras.de...
Uli Kusterer
witness_of_t...
Offline Send Email
Sep 17, 2005
9:12 am
578
... Yep :-) By the way, found this today: http://easynews.dl.sourceforge.net/sourceforge/inger/CompilerConstruction.pdf 246 page book on writing a compiler for...
Graham Toal
graham_toal
Offline Send Email
Sep 17, 2005
3:18 pm
579
I actually ran across a PDF on oolex yesterday and found that their approach made sense to me. What it described was the concept that each lexer rule is in a...
chris.cranford@...
chrisc062677
Offline Send Email
Sep 17, 2005
8:16 pm
580
Someone also mentioned that FLex/Lex returns against the rule with the longest match. Assuming you have "IF " as your input and two rules, one for 'IF' and...
chris.cranford@...
chrisc062677
Offline Send Email
Sep 17, 2005
8:22 pm
581
... I dunno, why don't you try it out! Here's an oldie from the 60's: in FORTRAN you can have a for loop DO 10 I = 1, 10 and a simple assignment DO10I = 1.10 ...
Graham Toal
graham_toal
Offline Send Email
Sep 17, 2005
9:13 pm
582
Essentially, Flex/Lex/JFlex apply two basic rules: 1. The longest match rule 2. When there's a tie, the first rule on the list is applied. The example of the...
Raheem Rufai
r_rufai
Offline Send Email
Sep 18, 2005
1:03 am
584
Can someone explain how to maintain alignment within my stack machine? I was considering the notion of using a block of memory as my stack machine. The code...
CRANFORD, CHRIS
crancran77
Online Now Send Email
Oct 5, 2005
10:29 am
585
... machine? ... stack machine. The code would be loaded into the bottom lower address portion of the memory block and the stack would grow from the higher...
Graham Toal
graham_toal
Offline Send Email
Oct 7, 2005
2:35 pm
586
... stack prior-to, during the call-to, and how to cleanup after calling a function and how to deal with the activation records on the stack? I forgot your...
Graham Toal
graham_toal
Offline Send Email
Oct 7, 2005
2:51 pm
587
Hello, I had written an interpreter approx 11 years back as part of my academic course project. It was not done the lex-yacc way, it was hard coded in c...
maheshkumaraguru@...
kay_mahesh
Offline Send Email
Oct 21, 2005
4:25 am
588
Hi Guys... I m in immediate need of the solution for writing a syntax analyser using lex and yacc....here the language i m using is C on Linux... (Red Hat...
promila_bcs_h
Offline Send Email
Nov 27, 2005
6:28 pm
589
Hi, Can any one please tell me what type of parser is used in most of the modern c/c++ compilers? I am actually interested in knowing as to what is the look...
Muhammad Ahsan Shafiq
mahsanshafiq
Online Now Send Email
Nov 27, 2005
6:28 pm
590
I hope everyone had a good new year. I have been very busy over the last few months with travel and just had a moment to revisit my compiler project I was...
Chris Cranford
chrisc062677
Offline Send Email
Jan 4, 2006
11:49 pm
591
Does anyone know of a program that I can use that would automatically extract the First and Follow sets from an EBNF or BNF grammar?...
ed_davis2
Offline Send Email
Jan 24, 2006
1:12 pm
592
... Take a look at Wirth's Pascal-S for one approach: www.moorecad.com/standardpascal/pascals.html has a good discussion of Pascal-S, and the original paper...
ed_davis2
Offline Send Email
Jan 24, 2006
1:17 pm
593
... http://home.earthlink.net/~slkpg/ Final paragraph. Haven't tried it myself. G...
Graham Toal
graham_toal
Offline Send Email
Jan 25, 2006
4:00 pm
594
... Thanks, I'll take a look. I also found that COCO/R (I don't know how I missed this) does, as well as one called wacco: www.codegen.com/freesoft/wacco.tgz ...
Ed Davis
ed_davis2
Offline Send Email
Jan 25, 2006
10:38 pm
595
What I originally thought is I'd need to define my stack as something like: unsigned char stack[32768]; // 32k stack. Can someone comment on this concept and...
CRANFORD, CHRIS
Chris.Cranford@...
Send Email
Jan 26, 2006
2:27 pm
596
... Do you need to fetch objects off in larger chunks than a byte at a time? I.e. is an integer fetch something like I = stack[SP] << 24 | stack[SP+1] << 16 |...
Graham Toal
graham_toal
Offline Send Email
Jan 26, 2006
2:35 pm
597
Yes, I will need to be able to put 32-bit addresses, integers, longs, floats, etc on the stack. Can you provide me an example of how to push these types of...
CRANFORD, CHRIS
Chris.Cranford@...
Send Email
Jan 26, 2006
5:09 pm
598
... off the top of my head, not run through a compiler... // method 1: ignore alignment, do everything a byte at a time #define push(x) push(&x, sizeof(x)) ...
Graham Toal
graham_toal
Offline Send Email
Jan 26, 2006
6:10 pm
599
When you say that it does not work well with binary code, are you refering to an actual executable binary file or just storing the data in an intermediate file...
CRANFORD, CHRIS
Chris.Cranford@...
Send Email
Jan 26, 2006
7:08 pm
600
... Executable. When fully compiled a single store into the stack should be a single instruction, not four plus overhead. When compiling, you generally know...
Graham Toal
graham_toal
Offline Send Email
Jan 26, 2006
7:49 pm
601
Graham, Again, thanks for all your help. I know we may have spoke about this in the past, but what about floats/doubles? These are 8-bytes. I extended your...
CRANFORD, CHRIS
Chris.Cranford@...
Send Email
Jan 27, 2006
1:16 am
602
Hi there, I am new to this group, and I hope someone could help me, sorting out my question? I have had a look at Fabrice Bellard's otcc(n) Compiler. I am very...
vincent007de
Offline Send Email
Jan 27, 2006
2:40 pm
603
... I'm not sure there is any special name for it, or any special technique. Basically his compiler is a straight-forward 1960's style 'student system'...
Graham Toal
graham_toal
Offline Send Email
Jan 27, 2006
3:13 pm
Messages 573 - 603 of 1320   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help