Thursday, September 30th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
12:12 am |
Re: Has lexing and parsing theory advanced since the 1970's? On Thursday, September 16, 2021 at 7:56:25 PM UTC+3, Roger L Costello wrote: > > That said, Flex & Bison is old. Has lexing/parsing theory advanced since the > 1970âs? If yes, are there parser generators available today which are based on |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
12:12 am |
Memory organisation of the Z80 Turbo Pascal compiler I have been thinking about the old TurboPascal compiler (actually about its predecessor COMPAS Pascal, which I used long ago, but I believe the original Z80 CP/M TurboPascal was exactly the same in this regard.)
In the TP 2.0 manual it says: "The recursion stack is used only by recursive procedures and |
Tuesday, September 21st, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
11:11 pm |
|
Saturday, September 18th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
8:07 pm |
Has lexing and parsing theory advanced since the 1970's? Roger L Costello <costello@mitre.org> asked:
> That said, Flex & Bison is old. Has lexing/parsing theory advanced since the > 1970âs? If yes, are there parser generators available today which are based on > those advances in lexing/parsing theory? Or does Flex & Bison still represent |
Friday, September 17th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:47 pm |
Re: Has lexing and parsing theory advanced since the 1970's? On 2021-09-14, Roger L Costello <costello@mitre.org> wrote: > Lately I have been learning to use Flex & Bison. As I understand it, Flex & > Bison (and other parser generators) are built on solid theory. As a result, > those parser generators were created quickly and cheaply using structured, |
Thursday, September 16th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
8:52 pm |
Re: Has lexing and parsing theory advanced since the 1970's? Roger L Costello <costello@mitre.org> writes: >That said, Flex & Bison is old. Has lexing/parsing theory advanced since the >1970s? If yes, are there parser generators available today which are based on >those advances in lexing/parsing theory? Or does Flex & Bison still represent |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
7:32 pm |
Has lexing and parsing theory advanced since the 1970's? Lately I have been learning to use Flex & Bison. As I understand it, Flex & Bison (and other parser generators) are built on solid theory. As a result, those parser generators were created quickly and cheaply using structured, well-known techniques. Contrast with parsers developed prior to the theory: |
Friday, September 10th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
7:27 pm |
Re: How does "Engineering a Compiler" (by Keith Cooper and Linda Torczon) compare to the Dragon Book (Principles of Compiler Design by Alfred Aho and Jeffery Ulman)? On Wed, 08 Sep 2021 05:30:52 GMT, anton@mips.complang.tuwien.ac.at (Anton Ertl) wrote:
>I have read the 1986 version of the Dragon Book (i.e., Aho, Sethi, >Ullman). It covers the front end part deeply, but is not so strong on >the back end part. |
Wednesday, September 8th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
4:59 pm |
Re: How does "Engineering a Compiler" (by Keith Cooper and Linda Torczon) compare to the Dragon Book (Principles of Compiler Design by Alfred Aho and Jeffery Ulman)? I have read the 1986 version of the Dragon Book (i.e., Aho, Sethi, Ullman). It covers the front end part deeply, but is not so strong on the back end part.
I have looked at Cooper & Torczon, but have not read it. But my impression was good; in particular it covered more of the back end. |
Tuesday, September 7th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:11 pm |
How does "Engineering a Compiler" (by Keith Cooper and Linda Torczon) compare to the Dragon Book (Principles of Compiler Design by Alfred Aho and Jeffery Ulman)? Hey everyone, I asked this question earlier on reddit, but for the diversity in opinions, I am posting the same question here as this group is particularly compiler-centric. So I have been thoroughly and religiously studying Compilers for a couple of |
Saturday, September 4th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
11:20 pm |
Re: Is it the job of a parser to validate the input data? On Thursday, August 12, 2021 at 10:52:15 AM UTC-5, Christopher F Clark wrote: > It is almost always done in the AST creation routines, not only do you > as our insightful moderator mentioned generally get better error > messages that way, but curiously, the features of extract a number, |
Thursday, August 12th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:52 pm |
Re: Is it the job of a parser to validate the input data? On Wed, 11 Aug 2021 22:24:49 +0000, Roger L Costello <costello@mitre.org> wrote: >There are many data formats which contain things like this: > >A number, N >N occurrences of something > >For example, 3 followed by the names of three students: |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:52 pm |
Is it the job of a parser to validate the input data? Roger L Costello <costello@mitre.org> asked:
> There are many data formats which contain things like this: > > A number, N > N occurrences of something > > For example, 3 followed by the names of three students: > > 3 > John Doe |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:22 am |
Is it the job of a parser to validate the input data? Hello Compiler Experts!
There are many data formats which contain things like this:
A number, N N occurrences of something
For example, 3 followed by the names of three students:
3 John Doe Sally Smith Judy Jones
I have a question about parsing such data. Is it the job of a parser to ensure |
Sunday, August 8th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
10:32 pm |
Re: Not normal for the same program to be faster in C# than in C++ [Visual Studio 2019] On Sunday, August 8, 2021 at 8:14:17 AM UTC-7, Dmitry A. Kazakov wrote:
(snip)
> P.S. Optimizations is a usual suspect of ruining benchmark measures.
Yes. But in this case, one might want to include some optimizations.
Note, though, that a good optimizer could optimize out all the loops, as no |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:13 pm |
|
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
6:13 pm |
Re: Not normal for the same program to be faster in C# than in C++ [Visual Studio 2019] On 2021-08-06 04:58, George Neuner wrote:
> I would modify your programs like so (in pseudo): > > total = 0 > allocate array > for N iterations > initialize array > start = current time > run the seive |
Friday, August 6th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
4:42 pm |
Re: Not normal for the same program to be faster in C# than in C++ [Visual Studio 2019] On Thu, 5 Aug 2021 18:24:48 -0000 (UTC), Paolo Ferraresi <fp.box@alice.it> wrote: : a C# program : a C++ program : > >I understand very well that the validity of such a game is almost null, >but since I remain convinced that the same code (and I repeat the same |
Thursday, August 5th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
10:15 pm |
Not normal for the same program to be faster in C# than in C++ [Visual Studio 2019] Hello, my name is Paolo Ferraresi and I program in both C# and C++, for passion/study. (sorry for my bad English but I will never learn properly) I like both C# and C++. I have no preclusions of the religion wars type. I find C# very convenient for almost any application but C++ should be |
Wednesday, July 28th, 2021 |
LJ.Rossia.org makes no claim to the content supplied through this journal account. Articles are retrieved via a public feed supplied by the site for this purpose. |
1:08 am |
Re: These days what percentage of a CPU's work involves doing arithmetic computations versus other, non-arithmetic computations? Roger L Costello schrieb am Mittwoch, 14. Juli 2021 um 21:42:37 UTC+2: > Hello Compiler Experts! > > As I understand it, computers were originally designed to do arithmetic > computations and in the old days nearly 100% of a CPU's work involved |