View source for Talk:Design of Roundtrip Parser

You do not have permission to edit this page, for the following reasons:

The action you have requested is limited to users in one of the groups: Autoconfirmed users, emailconfirmed, editors.
You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page:

== Optimization ==
<e>BREAK_AS</e> can be significantly optimized if the source text is not kept inside the node, but outside it. The following approaches are possible:
# Locked source code. The source code is saved in a secure place that can be accessed whenever needed. The pair <e>position</e>-<e>count</e> can be used to get the text of the node. <e>BREAK_AS</e> has no reference fields.
# Dictionary. All character sequences are stored in a central dictionary and <e>BREAK_AS</e> keeps an index of the corresponding sequence. <e>BREAK_AS</e> for the same character sequences share the same dictionary item. Text of the node corresponds to the text of an item in the dictionary. <e>BREAK_AS</e> has no reference fields. Dictionary can be organized in a way without reference fields as well.
It's even possible to avoid creating <e>BREAK_AS</e> altogether. It's sufficient to have a '''match list'''. If there are gaps in the indexes between two adjacent leaves in the AST, it means the missing items correspond to the <e>BREAK_AS</e> elements that can be found in '''match list'''. Any information that is written in <e>BREAK_AS</e> can be computed on the fly.

Return to Talk:Design of Roundtrip Parser.

Retrieved from "https://dev.eiffel.com/Talk:Design_of_Roundtrip_Parser"

View source for Talk:Design of Roundtrip Parser

Navigation

Development

Wiki

Search

Tools