The amazing group 13 parser generator
This presentation is the property of its rightful owner.
Sponsored Links
1 / 10

The Amazing Group 13 Parser Generator PowerPoint PPT Presentation


  • 53 Views
  • Uploaded on
  • Presentation posted in: General

The Amazing Group 13 Parser Generator. Jon Schmid Matthew Tong Justin Ward. Quick bit of honesty before the sale’s pitch. Currently use a slow version of a scanner. Quick bit of honesty before the sale’s pitch. However, supposedly a fix to the scanner is quick and easy

Download Presentation

The Amazing Group 13 Parser Generator

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


The amazing group 13 parser generator

The Amazing Group 13 Parser Generator

Jon Schmid

Matthew Tong

Justin Ward


Quick bit of honesty before the sale s pitch

Quick bit of honesty before the sale’s pitch

  • Currently use a slow version of a scanner


Quick bit of honesty before the sale s pitch1

Quick bit of honesty before the sale’s pitch

  • However, supposedly a fix to the scanner is quick and easy

  • Our features are nifty


Nifty features

Nifty Features

  • Allows the document to have mandatory or default values for attributes

  • Attribute values are typed


Attribute value typing

Attribute Value Typing

  • The values of attributes are stored in the tree as Objects of a specific type, being validated in the process

  • Defaults to STRING

  • Ex. <attribute name=“number” type=“INT”> will store the value of “number” as an Integer for retrieval as an integer


More nifty features

More Nifty Features

  • Our DTD format eliminates any possible ambiguity in the parse tree

  • Allows for multiple “chunks” of CDATA

  • Example: <A> blah blah <B/> more words </A> will produce the following:

<A>

CDATA:

blah blah

CDATA: More words

<B>


And wait there s more

And wait, there’s more…

  • Can easily be modified to have the returned parse tree validate future additions and modifications to the tree, rumored to be needed in the coming project

  • Completely “Java Doc”ed

  • Implements union


Union

Union

  • Allows multiple versions of each type of tag

  • Normal syntax:

    <element_type name=“A”>

    <element name=“element1”>

    </element_type>


Union1

Union

  • Example of multi-versioned type:

    A single C and D, or any number of D’s:

    <element_type name=“B”>

    <version>

    <element name=“C”>

    <element name=“D”>

    </version

    <version>

    <element name =“D” number=“*”>

    </version>

    </element_type>


Union2

Union

  • Nested tags can be any one of the versions

  • The Verifier system will keep track of the conditions of each version and eliminate a version when it becomes invalid

  • Example: On seeing a nested <D>, both versions would still be valid, but upon getting another <D> or a <C>, one version would be eliminated.

  • The documents themselves don’t even show that any multi-versioning is occurring: <B> <D/> <C/> </B>


  • Login