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!feeder.eternal-september.org!aioe.org!.POSTED.3d73Ybk3C5U4I2t8lv+lAQ.user.gioia.aioe.org!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: ANN: Simple components for Ada v4.41 released Date: Mon, 5 Aug 2019 17:56:43 +0200 Organization: Aioe.org NNTP Server Message-ID: References: <08dd7d33-bee9-4747-a9e2-ced6a5487659@googlegroups.com> NNTP-Posting-Host: 3d73Ybk3C5U4I2t8lv+lAQ.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:60.0) Gecko/20100101 Thunderbird/60.8.0 X-Notice: Filtered by postfilter v. 0.9.2 Content-Language: en-US Xref: reader01.eternal-september.org comp.lang.ada:56995 Date: 2019-08-05T17:56:43+02:00 List-Id: On 2019-08-05 16:22, Shark8 wrote: > Wow! > This is incredible news, especially for things like the Wasabee browser project. > There was someone who was working on an Ada/SPARK ASN.1 compiler (Peter Chapin?) and I think the people doing this project -- https://github.com/ttsiodras/asn1scc -- which *is* an ASN.1 compiler. I am aware of ASN1SCC, but I wanted an alternative approach that does not require code generator and can handle constraints dynamically. ASN.1 specifications are infested with objects defined up to "MAX" items. E.g. the LDAP filter is a variable record (CHOICE) with disjunctive and conjunctive forms as alternatives containing the LDAP filter recursively as terms. The number of terms is an unspecified MAX and the depth of recursion is kind of infinite. I have no idea how the generators handle this mess. If compiled literally, e.g. with MAX=256 depth=32, it would take a huge amount of memory while in reality it is bounded from above just by the message length. > WRT the OpenSSL dependency, how much work would it be to get rid of it? There is no dependency on OpenSSL. OpenSSL and GNUTLS are two back-ends used in the corresponding implementations of the secure connection handler. Both are separate gpr-projects. All network stacks are designed to work with any handler implementation. Should Ada TLS become available I would use it in yet another implementation of. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de