Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Expected Token Density in Random Stream andrew@tomazos.com (Andrew Tomazos) (2011-12-07) |
| Re: Expected Token Density in Random Stream kaz@kylheku.com (Kaz Kylheku) (2011-12-11) |
| Re: Expected Token Density in Random Stream andrew@tomazos.com (Andrew Tomazos) (2011-12-13) |
| Re: Expected Token Density in Random Stream gene.ressler@gmail.com (Gene) (2011-12-19) |
| From: | Kaz Kylheku <kaz@kylheku.com> |
| Newsgroups: | comp.compilers |
| Date: | Sun, 11 Dec 2011 17:56:42 +0000 (UTC) |
| Organization: | A noiseless patient Spider |
| References: | 11-12-015 |
| Keywords: | parse |
| Posted-Date: | 11 Dec 2011 16:42:34 EST |
On 2011-12-07, Andrew Tomazos <andrew@tomazos.com> wrote:
> Summary: We want to find out how often a given token appears in a
> random stream formed by concatenating randomly chosen strings from a
> given set of strings.
> (Note hits can overlap each other)
But tokens do not overlap, so you're not actually extracting tokens. Using C
tokens as an example, the C token >>= is one hit, not four. The longest match
calls for extracting three characters and moving on.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.