Friday, December 7, 2018

The principal programming model for grammar specific join

Applicatgions inherit the basic memory index schemes built in and apply a higher level of semantic for the structured data.  Typical is skip fields, jsing LazyJ optional select and collect or replace.

Html scraper does this, collect only anchors is a higher level grammar, but it is expressable as LazyJ as long as the higher level dictionary is available.  The grammar builds a unique interpretation of graph moves and generates clusters of local gaph calls using the memory methods.

Souds complex, but think of describing you app in LazyJ, with the structure control operators.  Then duplicate that in a sequence of Step, Skip,...;

It turns out to be useful, a LazyJ syntax forces grammar completeness with its slim distributive and ordering properties and well constructed operators. 

The same way we use linux command format for command and control. If one abstracts the fundamentals rules of grammar, then one gets a useful and common assembly syntax. In every common endeavor, the parties have some syntax in common, make an assembler for that. Then the higher level grammars are simpler, the unique header files go away.

No comments: