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,FREEMAIL_FROM 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: Victor Porton Newsgroups: comp.lang.ada Subject: Re: Encaspulation: What to export Date: Wed, 29 Nov 2017 20:46:27 +0200 Organization: Aioe.org NNTP Server Message-ID: References: NNTP-Posting-Host: ixW2q+EPQygHpaL7GaA/ag.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="ISO-8859-1" Content-Transfer-Encoding: 7Bit X-Complaints-To: abuse@aioe.org User-Agent: KNode/4.14.10 X-Notice: Filtered by postfilter v. 0.8.2 Xref: reader02.eternal-september.org comp.lang.ada:49254 Date: 2017-11-29T20:46:27+02:00 List-Id: Randy Brukardt wrote: > "Victor Porton" wrote in message > news:ovjv01$1r5c$1@gioia.aioe.org... >> Randy Brukardt wrote: >> >>> "Victor Porton" wrote in message >>> news:ovhst9$1a43$1@gioia.aioe.org... >>> ... >>>> I parse not a string but an RDF tree. It is similar to convert AST >>>> (abstract >>>> syntax tree) to another format. RDF is similar to an AST but more >>>> abstract. >>>> >>>> So it is NOT a deserialization operation in Ada sense. >>> >>> Calling the operation of creating an RDF (or XML or HTML or SGML ...) >>> tree >>> from "parsing" is a gross distortion from what really is going on. As >> >> No. I "parse" RDF (not a text file) and create data in other format. > > Yes, you (do something, but don't parse) RDF and create some other format. > Format transformations surely don't require parsing. My objection is that > what you are doing to create that other format is not parsing; it's rather > just a text to tree transformation that is deterministic (really a very It is not text to tree transformation. It is a transformation from a tree (in fact a directed graph) into another format. (This digraph is created parsing a text file, but this is a different story, because I use already ready binding of a C library to parse a text format into RDF graph.) Transformation from tree is very similar to parsing (yes, I use this word) from an abstract syntax tree to another format. When reading an AST, the word "parsing" is correct, despite it is not in any way text parsing. I do use the word "parsing" because it uses techniques very similar to text parsing, namely I use recursive descent. > simple state machine). Calling that "parsing" trivializes the much more > complex languages that parsers can make sense of. None of the on-line > languages (with the possible exception of CSS) require any parsing; SGML > was designed to not require parsing and all of these other formats kept > the basic design of SGML. > > Randy. -- Victor Porton - http://portonvictor.org