Constructing Programs as Executable Attribute Grammars | Zendy

Richard Frost | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Constructing Programs as Executable Attribute Grammars

Author(s) -

Richard Frost

Publication year - 1992

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/35.4.376

Subject(s) - programming language , computer science , l attributed grammar , executable , rule based machine translation , compiler , interpreter , definite clause grammar , context free grammar , modular design , theoretical computer science , artificial intelligence , parsing

Attributes grammars provide a formal yet intuitive notation for specifying the static semantics of programming languages and consequently have been used in various compiler generation systems. Their use, however, need not be limited to this. With a little change in perspective, many programs may be regarded as interpreters and constructed as executable attributable grammars. This major advantage is that the resulting modular declarative structure facilitates various aspects of the software development process

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research