From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Writing a scanner and parser in Ada
Date: Sun, 24 Dec 2017 10:08:52 +0100
Organization: Aioe.org NNTP Server
Message-ID: <p1nqr5$1oer$1@gioia.aioe.org>
References: <2d87298a-4d1f-446a-9d46-d4f03879246b@googlegroups.com>
NNTP-Posting-Host: TliDXSPe+gBSGCqP3SEJ2Q.user.gioia.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
X-Complaints-To: abuse@aioe.org
User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101
 Thunderbird/52.5.2
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.8.2
Xref: reader02.eternal-september.org comp.lang.ada:49621
Date: 2017-12-24T10:08:52+01:00
List-Id: <comp.lang.ada>

On 2017-12-24 02:15, Yves Cloutier wrote:

> I'd like to know if there are any examples of how to write a scanner
> and parser in Ada.

Table-driven parser:

    http://www.dmitry-kazakov.de/ada/components.htm#Parsers_etc

> I have a pet project where I have a DSL that I want to use as input,
> scan, parse, then output as Groff code.

Normally for a domain-specific language you would do all that in a 
single step: match source against current table, descent/ascent and/or 
generate code, repeat.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de