EULER: A generalization of ALGOL and its formal definition: Part 1

From MaRDI portal
Publication:5515806

DOI10.1145/365153.365162zbMath0141.14302OpenAlexW2441059602WikidataQ127332201 ScholiaQ127332201MaRDI QIDQ5515806

Helmut R. Weber, Niklaus Wirth

Publication date: 1966

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/365153.365162




Related Items (33)

Semantics of context-free languagesOn the descriptive power of simple precedence grammarsA basic course on compiler principlesEpsilon weak precedence grammars and languagesOn the number of registers needed to evaluate arithmetic expressionsBeyond operator-precedence grammars and languagesMultipass precedence analysisGeneralized overlap resolvable grammars and their parsersA sentence generator for testing parsersError detection in precedence parsersSR(s,k) parsers: A class of shift-reduce bounded-context parsersSemantic preserving translationsA semantic extension of BNFLinear precedence functions for weak precedence grammarsRecent developments in machine-independent job control languagesThe size of LALR (1) parsersA survey of state vectorsA note on weak operator precedence grammarsA note on weak operator precedence grammarsAmbiguity and precedence in syntax descriptionTranslation grammars for compilation and decompilationGeneralization learning techniques for automating the learning of heuristicsA graph theory oriented extension to ALGOLEulerQuantitative fuzzy semanticsPair grammars, graph languages and string-to-graph translationsSoft precedenceTop-down syntax nalysisEfficient LR(1) parsersOn the 'correct prefix property' in precedence parsersErratum to ``On the 'correct prefix property' in precedence parsersConstruction of recognition devices for regular languages from their Backus Normal Form definitionPrecedence technique is not worse than SLR(1)


Uses Software



This page was built for publication: EULER: A generalization of ALGOL and its formal definition: Part 1