Parsing languages by pattern matching

DOI10.1109/32.4672MaRDI QIDQ3801103zbMATH OpenOpenAlexFDO

Authors Teodor Rus

Publication date 1988

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/32.4672

zbMATH Keywords

compilerpartial correctness problempattern matchingprogramming language specification

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of compilers and interpreters (68N20) Searching and sorting (68P10)

Recommendations

• An algebraic model for programming languages
• Algebraic construction of compilers
• scientific article; zbMATH DE number 4033046
• scientific article; zbMATH DE number 782027
• On the algebraic definition of programming languages

Cited in

(7)

• Pattern selector grammars and several parsing algorithms in the context- free style
• Algebraic processing of programming languages
• PHRASE parsers from multi-axiom grammars
• A unified language processing methodology
• Using and parsing the Mizar language
• An algebraic model for programming languages
• scientific article; zbMATH DE number 2117129 (Why is no real title available?)

This page was built for publication: Parsing languages by pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801103)