Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
language:introduction [2022/05/13 08:26] rajit |
language:introduction [2022/05/13 08:31] (current) rajit |
||
|---|---|---|---|
| Line 72: | Line 72: | ||
| legal: | legal: | ||
| - | < | + | < |
| bitbucket b; | bitbucket b; | ||
| a1of2 x1; | a1of2 x1; | ||
| Line 81: | Line 81: | ||
| On the other hand, the following declaration is incorrect. | On the other hand, the following declaration is incorrect. | ||
| - | < | + | < |
| pbool 5; | pbool 5; | ||
| + | </ | ||
| + | < | ||
| -[ERROR]-> | -[ERROR]-> | ||
| </ | </ | ||
| Line 96: | Line 98: | ||
| consider the following definition of '' | consider the following definition of '' | ||
| - | < | + | < |
| defproc bitbucket(a1of2 d) | defproc bitbucket(a1of2 d) | ||
| { | { | ||
| Line 112: | Line 114: | ||
| result in the following message: | result in the following message: | ||
| - | < | + | < |
| bitbucket b; | bitbucket b; | ||
| a1of2 c; | a1of2 c; | ||
| b.p = c.d0; | b.p = c.d0; | ||
| + | </ | ||
| + | < | ||
| -[ERROR]-> | -[ERROR]-> | ||
| </ | </ | ||
| Line 141: | Line 145: | ||
| circuits. The simplest way to create an array is shown below. | circuits. The simplest way to create an array is shown below. | ||
| - | < | + | < |
| bool x[10]; | bool x[10]; | ||
| a1of2 y[5][3]; | a1of2 y[5][3]; | ||
| Line 153: | Line 157: | ||
| be specified as shown below | be specified as shown below | ||
| - | < | + | < |
| bool w[4..7]; // create Booleans w[4], ..., w[7] | bool w[4..7]; // create Booleans w[4], ..., w[7] | ||
| </ | </ | ||
| Line 162: | Line 166: | ||
| block. Consider the following instantiation: | block. Consider the following instantiation: | ||
| - | < | + | < |
| bool x[10]; | bool x[10]; | ||
| bool x[12..14]; | bool x[12..14]; | ||
| Line 172: | Line 176: | ||
| following, on the other hand, is not valid. | following, on the other hand, is not valid. | ||
| - | < | + | < |
| bool x[10]; | bool x[10]; | ||
| bool x[9..14]; | bool x[9..14]; | ||
| Line 189: | Line 193: | ||
| below. | below. | ||
| - | < | + | < |
| bool x[10]; | bool x[10]; | ||
| bool x[12..14]; | bool x[12..14]; | ||
| Line 203: | Line 207: | ||
| succeed, and their shapes also have to be compatible. | succeed, and their shapes also have to be compatible. | ||
| - | < | + | < |
| bool x[12]; | bool x[12]; | ||
| bool w[4][3]; | bool w[4][3]; | ||
| x=w; | x=w; | ||
| + | </ | ||
| + | < | ||
| -[ERROR]-> | -[ERROR]-> | ||
| Types `bool[12]' | Types `bool[12]' | ||
| Line 213: | Line 219: | ||
| The following are examples of valid connections: | The following are examples of valid connections: | ||
| - | < | + | < |
| bool x[10]; | bool x[10]; | ||
| bool x[10..12]; | bool x[10..12]; | ||
| Line 233: | Line 239: | ||
| carry chain for a ten bit ripple-carry adder. | carry chain for a ten bit ripple-carry adder. | ||
| - | < | + | < |
| fulladder fa[10]; | fulladder fa[10]; | ||
| (i : 9 : fa[i].co=fa[i+1].ci; | (i : 9 : fa[i].co=fa[i+1].ci; | ||
| Line 251: | Line 257: | ||
| indices are connected to '' | indices are connected to '' | ||
| - | < | + | < |
| bool x[10], y[10], z[10]; | bool x[10], y[10], z[10]; | ||
| Line 282: | Line 288: | ||
| instance, ACT files will tend to begin with | instance, ACT files will tend to begin with | ||
| - | < | + | < |
| bool Reset, | bool Reset, | ||
| </ | </ | ||
| Line 304: | Line 310: | ||
| within the namespace. | within the namespace. | ||
| - | < | + | < |
| namespace lib { | namespace lib { | ||
| export defchan a1of2 <: chan(bool) (bool d0,d1,a) { ... } | export defchan a1of2 <: chan(bool) (bool d0,d1,a) { ... } | ||
| Line 327: | Line 333: | ||
| Namespaces can be nested. For instance, we could have: | Namespaces can be nested. For instance, we could have: | ||
| - | < | + | < |
| namespace processor { | namespace processor { | ||
| namespace lib { | namespace lib { | ||
| - | | + | |
| } | } | ||
| Line 345: | Line 351: | ||
| '' | '' | ||
| - | < | + | < |
| namespace processor { | namespace processor { | ||
| namespace lib { | namespace lib { | ||
| - | | + | |
| } | } | ||
| Line 355: | Line 361: | ||
| processor:: | processor:: | ||
| + | </ | ||
| + | < | ||
| -[ERROR]-> | -[ERROR]-> | ||
| | | ||
| Line 363: | Line 371: | ||
| exporting the namespace itself. | exporting the namespace itself. | ||
| - | < | + | < |
| namespace processor { | namespace processor { | ||
| export namespace lib { | export namespace lib { | ||
| - | | + | |
| } | } | ||
| Line 402: | Line 410: | ||
| '' | '' | ||
| - | < | + | < |
| import " | import " | ||
| ... | ... | ||
| Line 424: | Line 432: | ||
| the namespaces, and could create naming conflicts (e.g. multiple | the namespaces, and could create naming conflicts (e.g. multiple | ||
| definition of types having the same name---an error). To solve this | definition of types having the same name---an error). To solve this | ||
| - | problem, one can do the following: | + | problem, one can do the following: |
| - | < | + | < |
| import " | import " | ||
| open lib -> lib1; | open lib -> lib1; | ||
| Line 446: | Line 454: | ||
| because not all types might be exported! In this case we can say: | because not all types might be exported! In this case we can say: | ||
| - | < | + | < |
| import " | import " | ||
| open processor:: | open processor:: | ||
| Line 467: | Line 475: | ||
| hierarchy. The import statement | hierarchy. The import statement | ||
| - | < | + | < |
| import processor:: | import processor:: | ||
| </ | </ | ||
| Line 473: | Line 481: | ||
| is equivalent to the following: | is equivalent to the following: | ||
| - | < | + | < |
| import " | import " | ||
| </ | </ | ||