"Regular attribute grammars and finite state machines."

Nigel P. Chapman (1989)

> Home

Details and statistics

DOI: 10.1145/71052.71066

access: closed

type: Journal Article

metadata version: 2020-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigplan/Chapman89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigplan/Chapman89
Nigel P. Chapman:
Regular attribute grammars and finite state machines. ACM SIGPLAN Notices 24(6): 97-105 (1989)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.