scientific article; zbMATH DE number 1533832

MaRDI QIDQ4517047zbMATH OpenFDO

Authors I. N. Mikhajlov

Publication date 20 November 2000

zbMATH Keywords

compilerpattern matchingproduction systemREFAL

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Review text

The author proposes a new algorithm of pattern matching and a convenient language for its realization called RLM (Recursive Language of Members). The RLM language is analogous to the LM language which is used in the REFAL compiler as an intermediate language. The use of RLM makes it possible to improve the existing realization of the REFAL compiler. For the entire collection see [Zbl 0944.00029].

Recommendations

• A pattern matching compiler for multiple target languages
• Extensible pattern matching via a lightweight language extension
• A new regular grammar pattern matching algorithm
• Extended pattern matching for embedded languages
• A new regular grammar pattern matching algorithm.
• Refined compilation of pattern-matching for functional languages
• scientific article; zbMATH DE number 4164129
• New multi-pattern matching algorithm

Cited in

(4)

• An improved bottom-up method for implementing equational programming language
• Syntactic properties of the refal language
• A string pattern matching extension to pascal and some comparisons with snobol4
• RIGAL -- a programming language for compiler writing

This page was built for publication:

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