Re: some guideline to lexer or parser

From	"SLK Mail" <slkpg4@gmail.com>
Newsgroups	comp.compilers
Subject	Re: some guideline to lexer or parser
Date	2017-03-01 09:27 -0800
Organization	SLK Systems
Message-ID	<17-03-003@comp.compilers> (permalink)
References	<17-02-005@comp.compilers>

Show all headers | View raw

Lexing is not hard. If simple enough, you might even use the C library
strtok() to tokenize. Re2c is another C possibility.

If the grammar is recursive, then recursive descent might be fairly easy
to learn.

For simple grammars, I still think a parser generator like SLK is the
quickest way to get it done in C, C++, C#, Java, or Javascript.

The SLK Parser Generator - http://www.slkpg.com

Back to comp.compilers | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

some guideline to lexer or parser chano <noemail@no.spam.com> - 2017-02-27 04:53 +0000
  Re: some guideline to lexer or parser George Neuner <gneuner2@comcast.net> - 2017-02-27 15:39 -0500
  Re: some guideline to lexer or parser Hans Aberg <haberg-news@telia.com> - 2017-02-27 18:51 +0100
  Re: some guideline to lexer or parser Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2017-02-28 11:25 +0100
  Re: some guideline to lexer or parser "SLK Mail" <slkpg4@gmail.com> - 2017-03-01 09:27 -0800

csiph-web