Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
3679 articles, 1143 threads (numbers 61 – 3773) — flat view
| Advanced| Subject | Author | Date |
|---|---|---|
| State-of-the-art algorithms for lexical analysis? (12 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-06-05 20:53 +0000 |
| → Re: State-of-the-art algorithms for lexical analysis? | gah4 <gah4@u.washington.edu> | 2022-06-05 16:05 -0700 |
| → Re: State-of-the-art algorithms for lexical analysis? | Hans-Peter Diettrich <DrDiettrich1@netscape.net> | 2022-06-06 08:59 +0200 |
| → State-of-the-art algorithms for lexical analysis? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-06-06 21:16 +0300 |
| → Re: State-of-the-art algorithms for lexical analysis? | Hans-Peter Diettrich <DrDiettrich1@netscape.net> | 2022-06-07 06:52 +0200 |
| → Re: State-of-the-art algorithms for lexical analysis? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-06-07 19:40 +0300 |
| → Re: State-of-the-art algorithms for lexical analysis? | Hans-Peter Diettrich <DrDiettrich1@netscape.net> | 2022-06-08 05:32 +0200 |
| → Re: counted strings, was State-of-the-art algorithms for lexical analysis? | gah4 <gah4@u.washington.edu> | 2022-06-09 11:54 -0700 |
| → Re: counted characters in strings | "Robin Vowels" <robin51@dodo.com.au> | 2022-06-10 12:21 +1000 |
| → Re: counted characters in strings | Martin Ward <martin@gkc.org.uk> | 2022-06-11 10:52 +0100 |
| → Re: counted characters in strings | drb@msu.edu (Dennis Boone) | 2022-06-11 11:09 -0500 |
| → Re: State-of-the-art algorithms for lexical analysis? | Kaz Kylheku <480-992-1380@kylheku.com> | 2022-06-06 16:00 +0000 |
| → References for PSL ? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-06-06 20:11 +0300 |
| Are there "compiler generators"? (14 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-05-28 22:27 +0000 |
| → Re: Are there "compiler generators"? | "Robin Vowels" <robin51@dodo.com.au> | 2022-05-29 13:34 +1000 |
| → Re: Are there "compiler generators"? | Jan Ziak <0xe2.0x9a.0x9b@gmail.com> | 2022-05-28 23:52 -0700 |
| → Re: Are there "compiler generators"? | anton@mips.complang.tuwien.ac.at (Anton Ertl) | 2022-05-29 06:45 +0000 |
| → Re: Are there "compiler generators"? | Thomas Koenig <tkoenig@netcologne.de> | 2022-05-29 09:14 +0000 |
| → Re: Are there "compiler generators"? | Hans-Peter Diettrich <DrDiettrich1@netscape.net> | 2022-05-30 14:53 +0200 |
| → Re: Are there "compiler generators"? | Hans-Peter Diettrich <DrDiettrich1@netscape.net> | 2022-05-31 12:57 +0200 |
| → Re: Are there "compiler generators"? | gah4 <gah4@u.washington.edu> | 2022-05-31 16:55 -0700 |
| → RE: Are there compiler generators? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-06-01 14:07 +0300 |
| → Re: Are there "compiler generators"? | Martin Ward <martin@gkc.org.uk> | 2022-05-29 12:00 +0100 |
| → Re: Are there "compiler generators"? | anton@mips.complang.tuwien.ac.at (Anton Ertl) | 2022-05-30 07:35 +0000 |
| → Re: Are there "compiler generators"? | Fernando <pronesto@gmail.com> | 2022-05-29 05:00 -0700 |
| → Re: Are there "compiler generators"? | gah4 <gah4@u.washington.edu> | 2022-05-29 23:29 -0700 |
| → Re: Are there "compiler generators"? | mac <acolvin@efunct.com> | 2022-06-09 14:12 +0000 |
| → Re: Are there "compiler generators"? | Kaz Kylheku <480-992-1380@kylheku.com> | 2022-05-30 20:20 +0000 |
| Re: Are there "compiler generators"? (4 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-06-01 11:23 +0000 |
| → Re: Are there "compiler generators"? | anton@mips.complang.tuwien.ac.at (Anton Ertl) | 2022-06-01 18:05 +0000 |
| → Re: Are there "compiler generators"? | gah4 <gah4@u.washington.edu> | 2022-06-01 14:02 -0700 |
| → Re: Are there "compiler generators"? | "minf...@arcor.de" <minforth@arcor.de> | 2022-06-07 07:22 -0700 |
| → Re: Are there "compiler generators"? | Thomas Koenig <tkoenig@netcologne.de> | 2022-06-07 18:34 +0000 |
| Error correction -- was State-of-the-art algorithms for lexical analysis? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-06-07 09:22 +0300 |
| Re: State-of-the-art algorithms for lexical analysis? (2 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-06-06 10:48 +0000 |
| → Re: State-of-the-art algorithms for lexical analysis? | gah4 <gah4@u.washington.edu> | 2022-06-06 10:03 -0700 |
| → Re: State-of-the-art algorithms for lexical analysis? | gah4 <gah4@u.washington.edu> | 2022-06-06 12:25 -0700 |
| An ingenious scanning problem! (1 reply — unroll) | Roger L Costello <costello@mitre.org> | 2022-05-28 19:03 +0000 |
| → RE: An ingenious scanning problem! | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-06-01 13:34 +0300 |
| Who first invented dotted-item notation? (5 replies — unroll) | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-22 12:32 +0300 |
| → Re: Who first invented dotted-item notation? | Kaz Kylheku <480-992-1380@kylheku.com> | 2022-05-22 18:29 +0000 |
| → RE: Who first invented dotted-item notation? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-23 13:23 +0300 |
| → Re: Who first invented dotted-item notation? | gah4 <gah4@u.washington.edu> | 2022-05-23 18:31 -0700 |
| → RE: Who first invented dotted-item notation? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-24 11:27 +0300 |
| → Re: Who first invented dotted-item notation? | antispam@math.uni.wroc.pl | 2022-05-28 04:51 +0000 |
| Seed7 Release 2022-05-22 | Thomas Mertes <mertesthomas@gmail.com> | 2022-05-24 04:16 -0700 |
| Table driven LL. | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-22 12:24 +0300 |
| Please provide a learning path for mastering lexical analysis languages (5 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-05-06 11:59 +0000 |
| → Re: Please provide a learning path for mastering lexical analysis languages | George Neuner <gneuner2@comcast.net> | 2022-05-08 12:52 -0400 |
| → Re: Please provide a learning path for mastering lexical analysis languages | Paul B Mann <parser.generator.guy@gmail.com> | 2022-05-08 22:27 -0700 |
| → Re: Please provide a learning path for mastering lexical analysis languages | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-22 12:12 +0300 |
| → Re: Please provide a learning path for mastering lexical analysis languages | luser droog <luser.droog@gmail.com> | 2022-05-08 18:08 -0700 |
| → Re: Please provide a learning path for mastering lexical analysis languages | gah4 <gah4@u.washington.edu> | 2022-05-13 13:42 -0700 |
| Fortran to C/C++ translation: a running example. (4 replies — unroll) | Rock Brentwood <rockbrentwood@gmail.com> | 2022-05-16 12:27 -0700 |
| → Re: Fortran to C/C++ translation: a running example. | Thomas Koenig <tkoenig@netcologne.de> | 2022-05-17 14:59 +0000 |
| → Re: Fortran to C/C++ translation: a running example. | Lydia Marie Williamson <lydiamariewilliamson@gmail.com> | 2022-05-20 16:34 -0700 |
| → Re: Fortran to C/C++ translation: a running example. | gah4 <gah4@u.washington.edu> | 2022-05-21 09:31 -0700 |
| → Re: Fortran to C/C++ translation: a running example. | Thomas Koenig <tkoenig@netcologne.de> | 2022-05-21 17:24 +0000 |
| The "philosophy" of why labeled trees aid in the translation process | Roger L Costello <costello@mitre.org> | 2022-05-21 15:12 +0000 |
| Re: [Rock Brentwood] Fortran to C/C++ translation: a running example. (1 reply — unroll) | Ian Lance Taylor <ianlancetaylor@gmail.com> | 2022-05-16 15:38 -0700 |
| → Re: [Rock Brentwood] Fortran to C/C++ translation: a running example. | Lydia Marie Williamson <lydiamariewilliamson@gmail.com> | 2022-05-20 16:44 -0700 |
| Ann: HAC v.0.1 Ada compiler | Gautier write-only address <gautier_niouzes@hotmail.com> | 2022-05-19 03:11 -0700 |
| Ada-Europe - AEiC 2022 early registration deadline approaching (Belgium, June 2022) | Dirk.Craeynest@cs.kuleuven.be (Dirk Craeynest) | 2022-05-16 22:15 +0200 |
| Flex is the most powerful lexical analysis language in the world. True or False? (8 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-05-04 11:22 +0000 |
| → Re: Flex is the most powerful lexical analysis language in the world. True or False? | Tom Shields <thomas.evans.shields@gmail.com> | 2022-05-04 14:14 -0500 |
| → Flex is the most powerful lexical analysis language in the world. True or False? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-05 15:20 +0300 |
| → RE: Flex is the most powerful lexical analysis language in the world. True or False? | Roger L Costello <costello@mitre.org> | 2022-05-06 11:16 +0000 |
| → RE: Flex is the most powerful lexical analysis language in the world. True or False? | Christopher F Clark <christopher.f.clark@compiler-resources.com> | 2022-05-07 13:15 +0300 |
| → Simple Lexer and Simple Parser [ was RE: Flex is the most powerful lexical analysis language in the world. True or False? ] | Roger L Costello <costello@mitre.org> | 2022-05-08 13:34 +0000 |
| → Re: Flex is the most powerful lexical analysis language in the world. True or False? | George Neuner <gneuner2@comcast.net> | 2022-05-06 11:00 -0400 |
| → Re: Flex is the most powerful lexical analysis language in the world. True or False? | gah4 <gah4@u.washington.edu> | 2022-05-06 14:30 -0700 |
| → Re: fun with Postscript, was Flex is the most powerful lexical analysis language in the world. True or False? | gah4 <gah4@u.washington.edu> | 2022-05-07 13:10 -0700 |
| Announcing Ox release 1.10.2 | Tom Shields <thomas.evans.shields@gmail.com> | 2022-05-06 20:35 -0500 |
| Ada-Europe Int.Conf. Reliable Software Technologies, AEiC 2022 (Belgium, June 2022) | Dirk.Craeynest@cs.kuleuven.be (Dirk Craeynest) | 2022-05-03 21:40 +0200 |
| Using a C struct to represent a node in a parse tree ... how many fields in the struct? (4 replies — unroll) | Roger L Costello <costello@mitre.org> | 2022-04-08 11:17 +0000 |
| → Re: Using a C struct to represent a node in a parse tree ... how many fields in the struct? | Johann Klammer <klammerj@NOSPAM.a1.net> | 2022-04-08 20:44 +0200 |
| → Re: Using a C struct to represent a node in a parse tree ... how many fields in the struct? | Kaz Kylheku <480-992-1380@kylheku.com> | 2022-04-08 19:49 +0000 |
| → Re: Using a C struct to represent a node in a parse tree ... how many fields in the struct? | "marb...@yahoo.co.uk" <marblypup@yahoo.co.uk> | 2022-04-09 05:03 -0700 |
| → Re: Using a C struct to represent a node in a parse tree ... how many fields in the struct? | luser droog <luser.droog@gmail.com> | 2022-04-27 21:22 -0700 |
| Programming language similarity (8 replies — unroll) | Derek Jones <derek@NOSPAM-knosof.co.uk> | 2022-04-25 00:00 +0100 |
| → Re: Programming language similarity | Derek Jones <derek@NOSPAM-knosof.co.uk> | 2022-04-25 08:59 +0100 |
| → Re: Programming language similarity | Fernando <pronesto@gmail.com> | 2022-04-25 04:24 -0700 |
| → Re: Programming language similarity | Derek Jones <derek@NOSPAM-knosof.co.uk> | 2022-04-25 19:35 +0100 |
| → Re: Programming language similarity | Jan Ziak <0xe2.0x9a.0x9b@gmail.com> | 2022-04-25 06:00 -0700 |
| → Re: Programming language similarity | Derek Jones <derek@NOSPAM-knosof.co.uk> | 2022-04-25 20:51 +0100 |
| → Re: Programming language similarity | gah4 <gah4@u.washington.edu> | 2022-04-25 14:58 -0700 |
| → Re: Programming language similarity | Derek Jones <derek@NOSPAM-knosof.co.uk> | 2022-04-26 00:50 +0100 |
| → Re: Programming language similarity | Meshach Mitchell <meshach.mitchell@gmail.com> | 2022-04-25 12:06 -0400 |
← Newer ~Page 11 of ~58 (articles 2988–3068) Older →
csiph-web