Re: String tokenizer place in Chomsky hierarchy?

sipayi@gmail.com
Tue, 15 Apr 2008 05:31:33 -0700 (PDT)

          From comp.compilers
Related articles
String tokenizer place in Chomsky hierarchy? TegiriNenashi@gmail.com (Tegiri Nenashi) (2008-04-08)
Re: String tokenizer place in Chomsky hierarchy? maharri@gmail.com (Mitch) (2008-04-11)
Re: String tokenizer place in Chomsky hierarchy? DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-04-11)
Re: String tokenizer place in Chomsky hierarchy? sipayi@gmail.com (2008-04-15)
Re: String tokenizer place in Chomsky hierarchy? markwh04@yahoo.com (Rock Brentwood) (2008-04-25)
| List of all articles for this month |
From: sipayi@gmail.com
Newsgroups: comp.compilers,comp.theory
Date: Tue, 15 Apr 2008 05:31:33 -0700 (PDT)
Organization: Compilers Central
References: 08-04-030 08-04-040
Keywords: lex, theory
Posted-Date: 15 Apr 2008 13:54:59 EDT

On Apr 11, 11:15 am, Hans-Peter Diettrich <DrDiettri...@aol.com>
wrote:
> Tegiri Nenashi wrote:
> > String tokenizer is the simplest parser of all. In java, arguably, it
> > is much more frequently used than regular expressions. Yet I fail to
> > see any parsing theory book ever mentioning it.




Isn't this a case of simple Mealy machine?
Q = {q0, q1}
Q0 = q0
S = {1, b, c}
O = {"b", "c", "bb", "bc", "cc", "cb".... }
D =
                    q0 q1
      +------------------------
a | q0 q0
b | q1 q1
c | q1 q1




G =
                    q0 q1
        +------------------------
q0 | print() print()
q0 | append() append()
q0 | append() append()




=> Class-3, RegEx?


-sip

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.