|
|
1.1 root 1: .TH RCSFILE 5 6/29/83 "Purdue University"
2: .SH NAME
3: rcsfile \- format of RCS file
4: .SH DESCRIPTION
5: An RCS file is an ASCII file. Its contents is described by the grammar
6: below. The text is free format, i.e., spaces, tabs and new lines have
7: no significance except in strings. Strings are enclosed by `@'.
8: If a string contains a `@', it must be doubled.
9: .PP
10: The meta syntax uses the following conventions: `|' (bar) separates
11: alternatives; `{' and `}' enclose optinal phrases; `{' and `}*' enclose
12: phrases that may be repeated zero or more times;
13: `{' and '}+' enclose phrases that must appear at least once and may be
14: repeated;
15: `<' and `>' enclose nonterminals.
16: .PP
17: .ta 1.5i 2.0i 3i
18: .fc ~
19: .nf
20:
21:
22: <rcstext> ~~::=~~<admin> {<delta>}* <desc> {<deltatext>}*
23:
24: <admin> ~~::=~~\fBhead\fR ~~{<num>};
25: ~~ ~~\fBaccess\fR ~~{<id>}*;
26: ~~ ~~\fBsymbols\fR ~~{<id> : <num>}*;
27: ~~ ~~\fBlocks\fR ~~{<id> : <num>}*;
28: ~~ ~~\fBcomment\fR ~~{<string>};
29:
30: <delta> ~~::=~~<num>
31: ~~ ~~\fBdate\fR ~~<num>;
32: ~~ ~~\fBauthor\fR ~~<id>;
33: ~~ ~~\fBstate\fR ~~{<id>};
34: ~~ ~~\fBbranches\fR ~~{<num>}*;
35: ~~ ~~\fBnext\fR ~~{<num>};
36:
37: <desc> ~~::=~~\fBdesc\fR ~~<string>
38:
39: <deltatext>~~::=~~<num>
40: ~~ ~~\fBlog\fR ~~<string>
41: ~~ ~~\fBtext\fR ~~<string>
42:
43:
44: <num> ~~::=~~{<digit>{.}}+
45:
46: <digit> ~~::=~~0 | 1 | ... | 9
47:
48: <id> ~~::=~~<letter>{<idchar>}*
49:
50: <letter> ~~::=~~A | B | ... | Z | a | b | ... | z
51:
52: <idchar> ~~::=~~Any printing ASCII character except space,
53: ~~ ~~tab, carriage return, new line, and <special>.
54:
55: <special> ~~::=~~; | : | , | @
56:
57: <string> ~~::=~~@{any ASCII character, with `@' doubled}*@
58:
59: .fi
60: .PP
61: Identifiers are case sensitive. Keywords are in lower case only.
62: The sets of keywords and identifiers may overlap.
63: .PP
64: The <delta> nodes form a tree. All nodes whose numbers
65: consist of a single pair
66: (e.g., 2.3, 2.1, 1.3, etc.)
67: are on the "trunk", and are linked through the "next"
68: field in order of decreasing numbers. The "head" field in the
69: <admin> node points to the head of that sequence (i.e., contains
70: the highest pair).
71: .PP
72: All <delta> nodes whose numbers consist of 2n fields (n\(>=2)
73: (e.g., 3.1.1.1, 2.1.2.2, etc.)
74: are linked as follows. All nodes whose first (2n)-1 number fields are identical
75: are linked through the "next" field in order of increasing numbers.
76: For each such sequence,
77: the <delta> node whose number is identical to the first
78: 2(n-1) number fields of the deltas on that sequence is called the branchpoint.
79: The "branches" field of a node contains a list of the
80: numbers of the first nodes of all sequences for which it is a branchpoint.
81: This list is ordered in increasing numbers.
82: .PP
83: Example:
84: .nf
85: .vs 12pts
86: .cs 1 20
87: Head
88: |
89: |
90: v
91: ---------
92: / \\ / \\ | | / \\ / \\
93: / \\ / \\ | 2.1 | / \\ / \\
94: / \\ / \\ | | / \\ / \\
95: /1.2.1.3\\ /1.3.1.1\\ | | /1.2.2.2\\ /1.2.2.1.1.1\\
96: --------- --------- --------- --------- -------------
97: ^ ^ | ^ ^
98: | | | | |
99: | | v | |
100: / \\ | --------- / \\ |
101: / \\ | \\ 1.3 / / \\ |
102: / \\ ---------\\ / / \\-----------
103: /1.2.1.1\\ \\ / /1.2.2.1\\
104: --------- \\ / ---------
105: ^ | ^
106: | | |
107: | v |
108: | --------- |
109: | \\ 1.2 / |
110: ----------------------\\ /---------
111: \\ /
112: \\ /
113: |
114: |
115: v
116: ---------
117: \\ 1.1 /
118: \\ /
119: \\ /
120: \\ /
121:
122:
123: .cs 1
124: .ce
125: Fig. 1: A revision tree
126: .fi
127: .PP
128: .SH IDENTIFICATION
129: .de VL
130: \\$2
131: ..
132: Author: Walter F. Tichy,
133: Purdue University, West Lafayette, IN, 47907.
134: .sp 0
135: Revision Number:
136: .VL $Revision: 3.0 $
137: ; Release Date:
138: .VL $Date: 82/11/18 16:36:39 $
139: \&.
140: .sp 0
141: Copyright \(co 1982 by Walter F. Tichy.
142: .SH SEE ALSO
143: ci (1), co (1), ident (1), rcs (1), rcsdiff (1), rcsintro (1), rcsmerge (1), rlog (1), sccstorcs (8).
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.