PageRenderTime 40ms CodeModel.GetById 10ms RepoModel.GetById 0ms app.codeStats 0ms

/alliance-5.0/abv/src/bvl_bcomp_y.y

#
Happy | 2345 lines | 2111 code | 234 blank | 0 comment | 0 complexity | 463b6d91511872e04303d842eb855394 MD5 | raw file
Possible License(s): GPL-2.0, LGPL-2.0

Large files files are truncated, but you can click here to view the full file

    

  1. /*------------------------------------------------------------\
    2. 

  2. |                                                             |
    3. 

  3. | This file is part of the Alliance CAD System Copyright      |
    4. 

  4. | (C) Laboratoire LIP6 - Département ASIM Universite P&M Curie|
    5. 

  5. |                                                             |
    6. 

  6. | Home page      : http://www-asim.lip6.fr/alliance/          |
    7. 

  7. | E-mail         : mailto:alliance-users@asim.lip6.fr       |
    8. 

  8. |                                                             |
    9. 

  9. | This progam is  free software; you can redistribute it      |
    10. 

  10. | and/or modify it under the  terms of the GNU Library General|
    11. 

  11. | Public License as published by the Free Software Foundation |
    12. 

  12. | either version 2 of the License, or (at your option) any    |
    13. 

  13. | later version.                                              |
    14. 

  14. |                                                             |
    15. 

  15. | Alliance VLSI  CAD System  is distributed  in the hope that |
    16. 

  16. | it  will be useful, but WITHOUT  ANY WARRANTY;              |
    17. 

  17. | without even the  implied warranty of MERCHANTABILITY or    |
    18. 

  18. | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General       |
    19. 

  19. | Public License for more details.                            |
    20. 

  20. |                                                             |
    21. 

  21. | You should have received a copy  of the GNU General Public  |
    22. 

  22. | License along with the GNU C Library; see the file COPYING. |
    23. 

  23. | If not, write to the Free Software Foundation, Inc.,        |
    24. 

  24. | 675 Mass Ave, Cambridge, MA 02139, USA.                     |
    25. 

  25. |                                                             |
    26. 

  26. \------------------------------------------------------------*/
    27. 

  27. 

  28. /* ###--------------------------------------------------------------### */
    29. 

  29. /*									*/
    30. 

  30. /* file		: bvl_bcomp.yac						*/
    31. 

  31. /* date		: Oct  4 1993						*/
    32. 

  32. /* version	: v108							*/
    33. 

  33. /* author	: P. BAZARGAN, L.A. TABUSSE, VUONG H.N.			*/
    34. 

  34. /* content	: yacc rules for behavioural VHDL			*/
    35. 

  35. /*									*/
    36. 

  36. /* ###--------------------------------------------------------------### */
    37. 

  37. 

  38. %{
    39. 

  39. #include <stdio.h>
    40. 

  40. #include <stdlib.h>
    41. 

  41. #include <string.h>
    42. 

  42. #include "mut.h"
    43. 

  43. #include "aut.h"
    44. 

  44. #include "abl.h"
    45. 

  45. #include "bdd.h"
    46. 

  46. #include "abe.h"
    47. 

  47. 

  48. #include "bvl_utype.h"
    49. 

  49. #include "bvl_util.h"
    50. 

  50. #include "bvl_byacc.h"
    51. 

  51. #include "bvl_bedef.h"
    52. 

  52. 

  53. %}
    54. 

  54. 

  55. %union  {
    56. 

  56. 	long		 valu;
    57. 

  57. 	char		*text;
    58. 

  58.         bvl_ablstr       list;
    59. 

  59. 	bvl_name	 name;
    60. 

  60.         struct g_type dble;
    61. 

  61. 	};
    62. 

  62. 

  63. %token         tok_AND
    64. 

  64. %token  <valu> PRAGMA
    65. 

  65. %token         _BEGIN
    66. 

  66. %token         _END
    67. 

  67. %token         _EQSym
    68. 

  68. %token         _EXIT
    69. 

  69. %token         _FILE
    70. 

  70. %token         _GESym
    71. 

  71. %token         _GTSym
    72. 

  72. %token         _IN
    73. 

  73. %token         _INOUT
    74. 

  74. %token         _LABEL
    75. 

  75. %token         _LESym
    76. 

  76. %token         _LINKAGE
    77. 

  77. %token         _LTSym
    78. 

  78. %token         _NAND
    79. 

  79. %token         _NESym
    80. 

  80. %token         _NEXT
    81. 

  81. %token         _NOR
    82. 

  82. %token         _NOT
    83. 

  83. %token         tok_NULL
    84. 

  84. %token         _OR
    85. 

  85. %token         _OUT
    86. 

  86. %token         _XOR
    87. 

  87. %token         ABS
    88. 

  88. %token         ACCESS
    89. 

  89. %token         AFTER
    90. 

  90. %token         ALIAS
    91. 

  91. %token         ALL
    92. 

  92. %token         ARCHITECTURE
    93. 

  93. %token         ARRAY
    94. 

  94. %token         ASSERT
    95. 

  95. %token         ATTRIBUTE
    96. 

  96. %token  <text> AbstractLit
    97. 

  97. %token         Ampersand
    98. 

  98. %token         Apostrophe
    99. 

  99. %token         Arrow
    100. 

  100. %token         BIT
    101. 

  101. %token         BIT_VECTOR
    102. 

  102. %token         _BLOCK
    103. 

  103. %token         BODY
    104. 

  104. %token         BUFFER
    105. 

  105. %token         BUS
    106. 

  106. %token         Bar
    107. 

  107. %token         BasedInt
    108. 

  108. %token         BasedReal
    109. 

  109. %token  <text> BitStringLit
    110. 

  110. %token         Box
    111. 

  111. %token         CASE
    112. 

  112. %token         COMPONENT
    113. 

  113. %token         CONFIGURATION
    114. 

  114. %token         CONSTANT
    115. 

  115. %token  <text> CharacterLit
    116. 

  116. %token         Colon
    117. 

  117. %token         Comma
    118. 

  118. %token         DISCONNECT
    119. 

  119. %token         DOWNTO
    120. 

  120. %token         DecimalInt
    121. 

  121. %token         DecimalReal
    122. 

  122. %token         Dot
    123. 

  123. %token         DoubleStar
    124. 

  124. %token         ELSE
    125. 

  125. %token         ELSIF
    126. 

  126. %token         ENTITY
    127. 

  127. %token         ERROR
    128. 

  128. %token         FOR
    129. 

  129. %token         FUNCTION
    130. 

  130. %token         GENERATE
    131. 

  131. %token         GENERIC
    132. 

  132. %token         GUARDED
    133. 

  133. %token         IF
    134. 

  134. %token         IS
    135. 

  135. %token  <text> Identifier
    136. 

  136. %token         LIBRARY
    137. 

  137. %token         LOOP
    138. 

  138. %token         LeftParen
    139. 

  139. %token         MAP
    140. 

  140. %token         MOD
    141. 

  141. %token         MUX_BIT
    142. 

  142. %token         MUX_VECTOR
    143. 

  143. %token         Minus
    144. 

  144. %token         NATURAL
    145. 

  145. %token         NATURAL_VECTOR
    146. 

  146. %token         NEW
    147. 

  147. %token         OF
    148. 

  148. %token         ON
    149. 

  149. %token         OPEN
    150. 

  150. %token         OTHERS
    151. 

  151. %token         _PACKAGE
    152. 

  152. %token         PORT
    153. 

  153. %token         PROCEDURE
    154. 

  154. %token         PROCESS
    155. 

  155. %token         Plus
    156. 

  156. %token         _PS
    157. 

  157. %token         _NS
    158. 

  158. %token         _US
    159. 

  159. %token         _MS
    160. 

  160. %token         RANGE
    161. 

  161. %token         RECORD
    162. 

  162. %token         REG_BIT
    163. 

  163. %token         REG_VECTOR
    164. 

  164. %token         REGISTER
    165. 

  165. %token         REM
    166. 

  166. %token         REPORT
    167. 

  167. %token         RETURN
    168. 

  168. %token         RightParen
    169. 

  169. %token         SELECT
    170. 

  170. %token         SEVERITY
    171. 

  171. %token         SIGNAL
    172. 

  172. %token         _STABLE
    173. 

  173. %token         SUBTYPE
    174. 

  174. %token         Semicolon
    175. 

  175. %token         Slash
    176. 

  176. %token         Star
    177. 

  177. %token  <text> StringLit
    178. 

  178. %token         THEN
    179. 

  179. %token         TO
    180. 

  180. %token         TRANSPORT
    181. 

  181. %token         _TYPE
    182. 

  182. %token         UNITS
    183. 

  183. %token         UNTIL
    184. 

  184. %token         USE
    185. 

  185. %token         VARIABLE
    186. 

  186. %token         VarAsgn
    187. 

  187. %token         WAIT
    188. 

  188. %token         WARNING
    189. 

  189. %token         WHEN
    190. 

  190. %token         WHILE
    191. 

  191. %token         WITH
    192. 

  192. %token         WOR_BIT
    193. 

  193. %token         WOR_VECTOR
    194. 

  194. 

  195. %left         tok_AND _OR _NAND _NOR _XOR
    196. 

  196. %left         _EQSym _NESym
    197. 

  197. %left         _NOT
    198. 

  198. 

  199. %type <text> choice
    200. 

  200. %type <text> .simple_name.
    201. 

  201. %type <text> simple_name
    202. 

  202. %type <text> a_label
    203. 

  203. %type <text> .label.
    204. 

  204. %type <text> label
    205. 

  205. %type <valu> severity__message
    206. 

  206. %type <text> report__message
    207. 

  207. %type <valu> .SEVERITY__expression.
    208. 

  208. %type <text> .REPORT__expression.
    209. 

  209. %type <text> .guard_expression.
    210. 

  210. %type <text> guard_expression
    211. 

  211. 

  212. %type <list> ...waveform__WHEN__choices..
    213. 

  213. %type <list> waveform__WHEN__choices
    214. 

  214. %type <list> waveform_element
    215. 

  215. %type <list> waveform
    216. 

  216. %type <list> expression
    217. 

  217. %type <valu> .GUARDED.
    218. 

  218. 

  219. %type <list> relation..AND__relation..
    220. 

  220. %type <list> relation..OR__relation..
    221. 

  221. %type <list> relation.NAND_NOR__relation.
    222. 

  222. %type <list> relation..XOR__relation..
    223. 

  223. %type <list> relation
    224. 

  224. %type <list> simple_expression
    225. 

  225. %type <list> .sign.term..add_op__term..
    226. 

  226. %type <list> term
    227. 

  227. %type <list> factor
    228. 

  228. %type <list> primary
    229. 

  229. %type <valu> relational_operator
    230. 

  230. %type <text> literal
    231. 

  231. %type <list> aggregate
    232. 

  232. 

  233. %type <valu> .signal_kind.
    234. 

  234. %type <valu> .mode.
    235. 

  235. %type <dble> type_mark
    236. 

  236. %type <name> .constraint.
    237. 

  237. %type <name> constraint
    238. 

  238. %type <name> range
    239. 

  239. %type <valu> direction
    240. 

  240. %type <valu> abstractlit
    241. 

  241. %type <name> name
    242. 

  242. %type <name> slice_name
    243. 

  243. %type <name> indexed_name
    244. 

  244. %type <name> target
    245. 

  245. %type <name> attribute_name
    246. 

  246. 

  247. %type <valu> generic_element_association
    248. 

  248. 

  249. %type <text> constant_VarAsgn__expression
    250. 

  250. 

  251. %start design_file
    252. 

  252. 

  253. %%
    254. 

  254. 

  255. design_file
    256. 

  256. 	: /*empty*/
    257. 

  257. 		{
    258. 

  258. 		/* ###----------------------------------------------### */
    259. 

  259. 		/*    Initializations					*/
    260. 

  260. 		/*      - erroneous description presumed !		*/
    261. 

  261. 		/* ###----------------------------------------------### */
    262. 

  262. 

  263. 		BVL_NM1LST = NULL;
    264. 

  264. 		BVL_GRDLST = NULL;
    265. 

  265. 		BVL_CNDLST = NULL;
    266. 

  266. 		BVL_VALLST = NULL;
    267. 

  267. 		BVL_ERRFLG = 0;
    268. 

  268. 

  269. 		dic                = beh_initab ();
    270. 

  270. 		BVL_BEFPNT         = beh_addbefig (BVL_HEDFIG,NULL);
    271. 

  271. 		BVL_BEFPNT->ERRFLG = 1;
    272. 

  272. 		BVL_HEDFIG         = BVL_BEFPNT;
    273. 

  273. 		}
    274. 

  274. 	  entity_declaration
    275. 

  275. 	  architecture_body
    276. 

  276. 		{
    277. 

  277. 		struct beout *beout_pnt;
    278. 

  278. 		struct beaux *beaux_pnt;
    279. 

  279. 		struct bebus *bebus_pnt;
    280. 

  280. 		struct bereg *bereg_pnt;
    281. 

  281. 		struct berin *berin_pnt;
    282. 

  282. 		struct beaux *beaux_pred;
    283. 

  283. 		struct berin *berin_pred;
    284. 

  284. 

  285. 		/* ###----------------------------------------------### */
    286. 

  286. 		/*    Checking that each output have at least one driver*/
    287. 

  287. 		/* ###----------------------------------------------### */
    288. 

  288. 

  289. 		beout_pnt = BVL_BEFPNT->BEOUT;
    290. 

  290. 		while (beout_pnt != NULL)
    291. 

  291. 		  {
    292. 

  292. 		  if (beout_pnt->ABL == NULL)
    293. 

  293. 		    bvl_error (40, beout_pnt->NAME);
    294. 

  294. 		  beout_pnt = beout_pnt->NEXT;
    295. 

  295. 		  }
    296. 

  296. 

  297. 		beaux_pnt = BVL_BEFPNT->BEAUX;
    298. 

  298.       beaux_pred=NULL;
    299. 

  299. 		while (beaux_pnt != NULL)
    300. 

  300. 		  {
    301. 

  301.         if (beaux_pnt->ABL == NULL)
    302. 

  302.         {
    303. 

  303.           fprintf (stderr,"`%s` Warning %d line %d :",BVL_CURFIL,40,BVL_LINNUM);
    304. 

  304.           fprintf (stderr,"signal `%s` never assigned\n",beaux_pnt->NAME);
    305. 

  305.           
    306. 

  306.           /*removing signal*/
    307. 

  307.           if ( beaux_pred ) beaux_pred->NEXT = beaux_pnt->NEXT;
    308. 

  308.           else BVL_BEFPNT->BEAUX = beaux_pnt->NEXT;
    309. 

  309. 

  310.           /*removing other ref to signal*/
    311. 

  311.           berin_pred = NULL;
    312. 

  312.           for ( berin_pnt = BVL_BEFPNT->BERIN; berin_pnt; berin_pnt = berin_pnt->NEXT )
    313. 

  313.           {
    314. 

  314.              if ( berin_pnt->NAME == beaux_pnt->NAME )
    315. 

  315.              {
    316. 

  316.                  if ( berin_pred ) berin_pred->NEXT = berin_pnt->NEXT;
    317. 

  317.                  else BVL_BEFPNT->BERIN = berin_pnt->NEXT;
    318. 

  318.                  break;
    319. 

  319.              }
    320. 

  320.              berin_pred = berin_pnt;
    321. 

  321.           }
    322. 

  322.         }
    323. 

  323.         else beaux_pred = beaux_pnt;
    324. 

  324. 		  beaux_pnt = beaux_pnt->NEXT;
    325. 

  325. 		  }
    326. 

  326. 

  327. 		bebus_pnt = BVL_BEFPNT->BEBUS;
    328. 

  328. 		while (bebus_pnt != NULL)
    329. 

  329. 		  {
    330. 

  330. 		  if (bebus_pnt->BIABL == NULL)
    331. 

  331. 		    bvl_error (40, bebus_pnt->NAME);
    332. 

  332. 		  bebus_pnt = bebus_pnt->NEXT;
    333. 

  333. 		  }
    334. 

  334. 

  335. 		bereg_pnt = BVL_BEFPNT->BEREG;
    336. 

  336. 		while (bereg_pnt != NULL)
    337. 

  337. 		  {
    338. 

  338. 		  if (bereg_pnt->BIABL == NULL)
    339. 

  339. 		    bvl_error (40,bereg_pnt->NAME);
    340. 

  340. 		  bereg_pnt = bereg_pnt->NEXT;
    341. 

  341. 		  }
    342. 

  342. 

  343. 		if (BVL_ERRFLG == 0)
    344. 

  344. 		  BVL_BEFPNT->ERRFLG = 0;
    345. 

  345. 

  346. 		beh_fretab (dic);
    347. 

  347. 		}
    348. 

  348. 	;
    349. 

  349. 

  350. entity_declaration
    351. 

  351. 	: ENTITY
    352. 

  352. 	  simple_name
    353. 

  353. 	  IS
    354. 

  354. 		{
    355. 

  355. 		BVL_BEFPNT->NAME = $2;
    356. 

  356. 		BVL_MODNAM       = $2;
    357. 

  357. 		}
    358. 

  358. 	  .generic_clause.
    359. 

  359. 	  .port_clause.
    360. 

  360. 	  END_ERR
    361. 

  361. 	  .simple_name.
    362. 

  362. 	  Semicolon_ERR
    363. 

  363. 		{
    364. 

  364. 		if (($8 != NULL) && ($8 != $2))
    365. 

  365. 		  bvl_error (1,$8);
    366. 

  366. 		}
    367. 

  367. 	| ENTITY
    368. 

  368. 	  error
    369. 

  369. 		{
    370. 

  370. 		bvl_error (2,NULL);
    371. 

  371. 		}
    372. 

  372. 	;
    373. 

  373. 

  374. .generic_clause.
    375. 

  375. 	: /*empty*/
    376. 

  376. 	| generic_clause
    377. 

  377. 		{
    378. 

  378. 		BVL_BEFPNT->BEGEN = BVL_GENPNT;
    379. 

  379. 		BVL_GENPNT = NULL;
    380. 

  380. 		}
    381. 

  381. 	;
    382. 

  382. 

  383. generic_clause
    384. 

  384. 	: GENERIC
    385. 

  385. 	  LeftParen
    386. 

  386. 	  formal_generic_list
    387. 

  387. 	  RightParen_ERR
    388. 

  388. 	  Semicolon_ERR
    389. 

  389. 	| GENERIC
    390. 

  390. 	  error
    391. 

  391. 	  Semicolon_ERR
    392. 

  392. 		{ bvl_error (74,NULL); }
    393. 

  393. 	;
    394. 

  394. 

  395. formal_generic_list
    396. 

  396. 	: formal_generic_element
    397. 

  397. 	  ...formal_generic_element..
    398. 

  398. 	;
    399. 

  399. 

  400. ...formal_generic_element..
    401. 

  401. 	: /*empty*/
    402. 

  402. 	| ...formal_generic_element..
    403. 

  403. 	  Semicolon_ERR
    404. 

  404. 	  formal_generic_element
    405. 

  405. 	;
    406. 

  406. 

  407. formal_generic_element
    408. 

  408. 	: CONSTANT
    409. 

  409. 	  identifier_list
    410. 

  410. 	  Colon
    411. 

  411. 	  type_mark
    412. 

  412. 	  .constraint.
    413. 

  413. 	  generic_VarAsgn__expression
    414. 

  414. 		{
    415. 

  415. 		char *type;
    416. 

  416. 

  417. 		if ($5.FLAG == $4.FLAG)
    418. 

  418. 		  {
    419. 

  419. 		  BVL_NM1LST = reverse (BVL_NM1LST);
    420. 

  420. 		  type = namealloc ("natural");
    421. 

  421. 		  BVL_GENPNT = bvl_addgen (BVL_GENPNT,BVL_INTLST,BVL_NM1LST,
    422. 

  422. 		                           type,$5.LEFT,$5.RIGHT);
    423. 

  423. 		  }
    424. 

  424. 		else
    425. 

  425. 		  bvl_error (33,NULL);
    426. 

  426. 		freechain (BVL_NM1LST);
    427. 

  427. 		freechain (BVL_INTLST);
    428. 

  428. 		BVL_NM1LST = NULL;
    429. 

  429. 		BVL_INTLST = NULL;
    430. 

  430. 		}
    431. 

  431. 	| error
    432. 

  432. 		{
    433. 

  433. 		/* ###----------------------------------------------### */
    434. 

  434. 		/*   The following 3 lines reject tokens until the	*/
    435. 

  435. 		/* sync. token 'Semicolon' is found			*/
    436. 

  436. 		/* ###----------------------------------------------### */
    437. 

  437. 

  438. 		do
    439. 

  439. 		  yychar = yylex ();
    440. 

  440. 		while ((yychar != Semicolon) && (yychar != 0));
    441. 

  441. 		yyerrok;
    442. 

  442. 		bvl_error (75,NULL);
    443. 

  443. 		}
    444. 

  444. 	;
    445. 

  445. 

  446. generic_VarAsgn__expression
    447. 

  447. 	: VarAsgn
    448. 

  448. 	  generic_expression
    449. 

  449. 	;
    450. 

  450. 

  451. generic_expression
    452. 

  452. 	: abstractlit
    453. 

  453. 		{
    454. 

  454. 		long *ptlong;
    455. 

  455. 

  456. 		ptlong = (long *) mbkalloc (sizeof(long));
    457. 

  457. 		*ptlong = $1;
    458. 

  458. 		BVL_INTLST = addchain (BVL_INTLST,(void *)ptlong);
    459. 

  459. 		}
    460. 

  460. 	| generic_aggregate
    461. 

  461. 	;
    462. 

  462. 

  463. generic_aggregate
    464. 

  464. 	: LeftParen
    465. 

  465. 	  generic_element_association
    466. 

  466. 		{
    467. 

  467. 		long *ptlong;
    468. 

  468. 

  469. 		ptlong = (long *) mbkalloc (sizeof(long));
    470. 

  470. 		*ptlong = $2;
    471. 

  471. 		BVL_INTLST = addchain (BVL_INTLST,(void *)ptlong);
    472. 

  472. 		}
    473. 

  473. 	  ...generic_element_association..
    474. 

  474. 	  RightParen_ERR
    475. 

  475. 	;
    476. 

  476. 

  477. ...generic_element_association..
    478. 

  478. 	: /* empty */
    479. 

  479. 	| ...generic_element_association..
    480. 

  480. 	  Comma
    481. 

  481. 	  generic_element_association
    482. 

  482. 		{
    483. 

  483. 		long *ptlong;
    484. 

  484. 

  485. 		ptlong = (long *) mbkalloc (sizeof(long));
    486. 

  486. 		*ptlong = $3;
    487. 

  487. 		BVL_INTLST = addchain (BVL_INTLST,(void *)ptlong);
    488. 

  488. 		}
    489. 

  489. 	;
    490. 

  490. 

  491. generic_element_association
    492. 

  492. 	: abstractlit
    493. 

  493. 		{$$ = $1;}
    494. 

  494. 	;
    495. 

  495. 

  496. .constraint.
    497. 

  497. 	: /*empty*/
    498. 

  498. 		{
    499. 

  499. 		$$.FLAG  = 'S';
    500. 

  500. 		$$.LEFT  = -1;
    501. 

  501. 		$$.RIGHT = -1;
    502. 

  502. 		}
    503. 

  503. 	| constraint
    504. 

  504. 		{ $$ = $1; }
    505. 

  505. 	;
    506. 

  506. 

  507. constraint
    508. 

  508. 	: LeftParen
    509. 

  509. 	  range
    510. 

  510. 	  RightParen_ERR
    511. 

  511. 		{ $$ = $2; }
    512. 

  512. 	;
    513. 

  513. 

  514. range
    515. 

  515. 	: abstractlit
    516. 

  516. 	  direction
    517. 

  517. 	  abstractlit
    518. 

  518. 		{
    519. 

  519. 		$$.FLAG  = 'A';
    520. 

  520. 		$$.LEFT  = $1;
    521. 

  521. 		$$.RIGHT = $3;
    522. 

  522. 

  523. 		if ((($1 > $3) && ($2 == BVL_UPTDFN)) ||
    524. 

  524. 		    (($1 < $3) && ($2 == BVL_DWTDFN)) ||
    525. 

  525. 		    (($1 < 0 ) || ($2 < 0 )))
    526. 

  526. 		  {
    527. 

  527. 		  bvl_error (32,NULL);
    528. 

  528. 		  }
    529. 

  529. 		}
    530. 

  530. 	;
    531. 

  531. 

  532. direction
    533. 

  533. 	: TO
    534. 

  534. 		{ $$ = BVL_UPTDFN; }
    535. 

  535. 	| DOWNTO
    536. 

  536. 		{ $$ = BVL_DWTDFN; }
    537. 

  537. 	;
    538. 

  538. 

  539. .port_clause.
    540. 

  540. 	: /*empty*/
    541. 

  541. 	| port_clause
    542. 

  542. 	;
    543. 

  543. 

  544. port_clause
    545. 

  545. 	: PORT
    546. 

  546. 	  LeftParen
    547. 

  547. 	  formal_port_list
    548. 

  548. 	  RightParen_ERR
    549. 

  549. 	  Semicolon_ERR
    550. 

  550. 	| PORT
    551. 

  551. 	  error
    552. 

  552. 	  Semicolon_ERR
    553. 

  553. 		{ bvl_error (3,NULL); }
    554. 

  554. 	;
    555. 

  555. 

  556. formal_port_list
    557. 

  557. 	: formal_port_element
    558. 

  558. 	  ...formal_port_element..
    559. 

  559. 	;
    560. 

  560. 

  561. ...formal_port_element..
    562. 

  562. 	: /*empty*/
    563. 

  563. 	| ...formal_port_element..
    564. 

  564. 	  Semicolon_ERR
    565. 

  565. 	  formal_port_element
    566. 

  566. 	;
    567. 

  567. 

  568. formal_port_element
    569. 

  569. 	: .SIGNAL.
    570. 

  570. 	  identifier_list
    571. 

  571. 	  Colon
    572. 

  572. 	  .mode.
    573. 

  573. 	  type_mark
    574. 

  574. 	  .constraint.
    575. 

  575. 	  .signal_kind.
    576. 

  576. 		{
    577. 

  577. 		char *signame;
    578. 

  578. 		long   sigconf;
    579. 

  579. 		void *pnt;
    580. 

  580. 

  581. 		/* ###----------------------------------------------### */
    582. 

  582. 		/*    First, check the validity of the declaration.	*/
    583. 

  583. 		/* Then, for each port, create the apropriate set of	*/
    584. 

  584. 		/* structures (berin, bepor, beout, bebus)		*/
    585. 

  585. 		/* ###----------------------------------------------### */
    586. 

  586. 

  587. 		chkdcl ('P', $4, $5.VALU, $5.FLAG, $7, $6.FLAG, &sigconf);
    588. 

  588. 

  589. 		BVL_NM1LST = reverse (BVL_NM1LST);
    590. 

  590. 		while (BVL_NM1LST != NULL)
    591. 

  591. 		  {
    592. 

  592. 		  signame = (char *)BVL_NM1LST->DATA;
    593. 

  593. 		  if (beh_chktab (dic,signame,BVL_MODNAM,BVL_SIGDFN) != 0)
    594. 

  594. 		    bvl_error (4,signame);
    595. 

  595. 

  596. 		  pnt = addstr (BVL_BEFPNT,'P',$4,$5.VALU,$5.FLAG,signame,
    597. 

  597. 		                $6.LEFT,$6.RIGHT);
    598. 

  598. 

  599. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_SIGDFN,sigconf);
    600. 

  600. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_WMNDFN,$6.LEFT);
    601. 

  601. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_WMXDFN,$6.RIGHT);
    602. 

  602. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_PNTDFN,(long)pnt);
    603. 

  603. 

  604. 		  BVL_NM1LST = delchain (BVL_NM1LST, BVL_NM1LST);
    605. 

  605. 		  }
    606. 

  606. 		}
    607. 

  607. 	| error
    608. 

  608. 		{
    609. 

  609. 		/* ###----------------------------------------------### */
    610. 

  610. 		/*   The following 3 lines reject tokens until the	*/
    611. 

  611. 		/* sync. token 'Semicolon' is found			*/
    612. 

  612. 		/* ###----------------------------------------------### */
    613. 

  613. 

  614. 		do
    615. 

  615. 		  yychar = yylex ();
    616. 

  616. 		while ((yychar != Semicolon) && (yychar != 0));
    617. 

  617. 		yyerrok;
    618. 

  618. 

  619. 		bvl_error (6,NULL);
    620. 

  620. 		}
    621. 

  621. 	;
    622. 

  622. 

  623. .SIGNAL.
    624. 

  624. 	: /*empty*/
    625. 

  625. 	| SIGNAL
    626. 

  626. 	;
    627. 

  627. 

  628. .mode.
    629. 

  629. 	: /*empty*/
    630. 

  630. 		{ $$ = _IN; }
    631. 

  631. 	| _IN
    632. 

  632. 		{ $$ = _IN; }
    633. 

  633. 	| _OUT
    634. 

  634. 		{ $$ = _OUT; }
    635. 

  635. 	| _INOUT
    636. 

  636. 		{ $$ = _INOUT; }
    637. 

  637. 	;
    638. 

  638. 

  639. architecture_body
    640. 

  640. 	: ARCHITECTURE
    641. 

  641. 	  Identifier
    642. 

  642. 	  OF
    643. 

  643. 	  simple_name
    644. 

  644. 	  IS
    645. 

  645. 		{
    646. 

  646. 		if ($4 != BVL_MODNAM)
    647. 

  647. 		  bvl_error (1,$4);
    648. 

  648. 		}
    649. 

  649. 	  architecture_declarative_part
    650. 

  650. 	  _BEGIN
    651. 

  651. 	  architecture_statement_part
    652. 

  652. 	  END_ERR
    653. 

  653. 	  .simple_name.
    654. 

  654. 	  Semicolon_ERR
    655. 

  655. 		{
    656. 

  656. 		if (($11 != NULL) && ($11 != $2))
    657. 

  657. 		  bvl_error (7,$11);
    658. 

  658. 		}
    659. 

  659. 	| ARCHITECTURE
    660. 

  660. 	  error
    661. 

  661. 		{ bvl_error (8,NULL); }
    662. 

  662. 	;
    663. 

  663. 

  664. architecture_declarative_part
    665. 

  665. 	: ..block_declarative_item..
    666. 

  666. 	;
    667. 

  667. 

  668. ..block_declarative_item..
    669. 

  669. 	: /*empty*/
    670. 

  670. 	| ..block_declarative_item..
    671. 

  671. 	  block_declarative_item
    672. 

  672. 	;
    673. 

  673. 

  674. block_declarative_item
    675. 

  675. 	: signal_declaration
    676. 

  676.         | pragma_declaration
    677. 

  677. 	| constant_declaration
    678. 

  678. 	| error
    679. 

  679. 	  Semicolon_ERR
    680. 

  680. 		{ bvl_error (9,NULL); }
    681. 

  681. 	;
    682. 

  682. 

  683. pragma_declaration
    684. 

  684.         :  PRAGMA
    685. 

  685.            {
    686. 

  686.              char pragma[30];
    687. 

  687.              char type  [100];
    688. 

  688.              char name  [100];
    689. 

  689. 

  690.              sscanf((char *)$1,"-- %s %s %s", pragma,type,name);
    691. 

  691. 

  692.              BVL_BEFPNT->BEPGM = beh_addbepgm(BVL_BEFPNT->BEPGM,
    693. 

  693.                                               type,name,(void *)0);
    694. 

  694.            }
    695. 

  695.            ;
    696. 

  696. 

  697. constant_declaration
    698. 

  698. 	: CONSTANT
    699. 

  699. 	  Identifier
    700. 

  700. 	  Colon
    701. 

  701. 	  type_mark
    702. 

  702. 	  .constraint.
    703. 

  703. 	  constant_VarAsgn__expression
    704. 

  704. 	  Semicolon_ERR
    705. 

  705. 		{
    706. 

  706. 		long sigconf;
    707. 

  707. 		
    708. 

  708. 		if (chkdcl ('C',0,$4.VALU,$4.FLAG,0,$5.FLAG,&sigconf) == 0)
    709. 

  709. 		  {
    710. 

  710. 		  beh_addtab (dic,$2,BVL_MODNAM,BVL_WMNDFN,$5.LEFT);
    711. 

  711. 		  beh_addtab (dic,$2,BVL_MODNAM,BVL_WMXDFN,$5.RIGHT);
    712. 

  712. 		  beh_addtab (dic,$2,BVL_MODNAM,BVL_SIGDFN,sigconf);
    713. 

  713. 		  beh_addtab (dic,$2,NULL,BVL_PNTDFN,$6);
    714. 

  714. 		  }
    715. 

  715. 		}
    716. 

  716. 	;
    717. 

  717. 

  718. constant_VarAsgn__expression
    719. 

  719. 	: VarAsgn
    720. 

  720. 	  literal
    721. 

  721. 		{ $$ = $2; }
    722. 

  722. 	;
    723. 

  723. 

  724. signal_declaration
    725. 

  725. 	: SIGNAL
    726. 

  726. 	  identifier_list
    727. 

  727. 	  Colon
    728. 

  728. 	  type_mark
    729. 

  729. 	  .constraint.
    730. 

  730. 	  .signal_kind.
    731. 

  731. 	  Semicolon_ERR
    732. 

  732. 		{
    733. 

  733. 		char *signame;
    734. 

  734. 		long   sigconf;
    735. 

  735. 		void *pnt;
    736. 

  736. 		long   errflg;
    737. 

  737. 

  738. 		errflg = chkdcl ('S',0,$4.VALU,$4.FLAG,$6,$5.FLAG,&sigconf);
    739. 

  739. 

  740. 		/* ###----------------------------------------------### */
    741. 

  741. 		/*    First, check the validity of the declaration.	*/
    742. 

  742. 		/* Then, for each signal, create the apropriate set of	*/
    743. 

  743. 		/* structures (berin, bereg, beaux, bebux)		*/
    744. 

  744. 		/* ###----------------------------------------------### */
    745. 

  745. 

  746. 		BVL_NM1LST = reverse (BVL_NM1LST);
    747. 

  747. 		while (BVL_NM1LST != NULL)
    748. 

  748. 		  {
    749. 

  749. 		  signame = (char *)BVL_NM1LST->DATA;
    750. 

  750. 		  if (beh_chktab (dic,signame,BVL_MODNAM,BVL_SIGDFN) != 0)
    751. 

  751. 		    bvl_error (10,signame);
    752. 

  752. 

  753. 		  pnt = addstr (BVL_BEFPNT,'S',0,$4.VALU,$4.FLAG,signame,
    754. 

  754. 		                $5.LEFT,$5.RIGHT);
    755. 

  755. 

  756. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_SIGDFN,sigconf);
    757. 

  757. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_WMNDFN,$5.LEFT);
    758. 

  758. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_WMXDFN,$5.RIGHT);
    759. 

  759. 		  beh_addtab (dic,signame,BVL_MODNAM,BVL_PNTDFN,(long)pnt);
    760. 

  760. 

  761. 		  BVL_NM1LST = delchain (BVL_NM1LST,BVL_NM1LST);
    762. 

  762. 		  }
    763. 

  763. 		}
    764. 

  764. 	;
    765. 

  765. 

  766. .signal_kind.
    767. 

  767. 	: /*empty*/
    768. 

  768. 		{ $$ = 0; }
    769. 

  769. 	| REGISTER
    770. 

  770. 		{ $$ = REGISTER; }
    771. 

  771. 	| BUS
    772. 

  772. 		{ $$ = BUS; }
    773. 

  773. 	;
    774. 

  774. 

  775. architecture_statement_part
    776. 

  776. 	: ..concurrent_statement..
    777. 

  777. 	;
    778. 

  778. 

  779. ..concurrent_statement..
    780. 

  780. 	: /*empty*/
    781. 

  781. 	| ..concurrent_statement..
    782. 

  782. 	  concurrent_statement
    783. 

  783. 	;
    784. 

  784. 

  785. concurrent_statement
    786. 

  786. 	: block_statement
    787. 

  787. 	| concurrent_assertion_statement
    788. 

  788. 	| concurrent_signal_assignment_statement
    789. 

  789. 	| error
    790. 

  790. 	  Semicolon_ERR
    791. 

  791. 		{ bvl_error (18,NULL); }
    792. 

  792. 	;
    793. 

  793. 

  794. block_statement
    795. 

  795. 	: a_label
    796. 

  796. 	  _BLOCK
    797. 

  797. 	  .guard_expression.
    798. 

  798. 	  _BEGIN
    799. 

  799. 		{
    800. 

  800. 		if (beh_chktab (dic,$1,BVL_MODNAM,BVL_LBLDFN) != 0)
    801. 

  801. 		  bvl_error (19,$1);
    802. 

  802. 

  803. 		beh_addtab (dic,$1,BVL_MODNAM,BVL_LBLDFN,1);
    804. 

  804. 		if ($3 != NULL)
    805. 

  805. 		  BVL_GRDLST = addchain (BVL_GRDLST,(char *)$3);
    806. 

  806. 		}
    807. 

  807. 	  set_of_statements
    808. 

  808. 	  END_ERR
    809. 

  809. 	  _BLOCK
    810. 

  810. 	  .label.
    811. 

  811. 	  Semicolon_ERR
    812. 

  812. 		{
    813. 

  813. 		if ($3 != NULL)
    814. 

  814. 		  BVL_GRDLST = delchain (BVL_GRDLST,BVL_GRDLST);
    815. 

  815. 		if (($9 != NULL) && ($9 != $1))
    816. 

  816. 		  bvl_error (20,$9);
    817. 

  817. 		}
    818. 

  818. 	;
    819. 

  819. 

  820. set_of_statements
    821. 

  821. 	: ..concurrent_statement..
    822. 

  822. 	;
    823. 

  823. 

  824. concurrent_assertion_statement
    825. 

  825. 	: a_label
    826. 

  826. 	  unlabeled_concurrent_assertion_statement
    827. 

  827. 		{
    828. 

  828. 		if (beh_chktab (dic,$1,BVL_MODNAM,BVL_LBLDFN) != 0)
    829. 

  829. 		  bvl_error (19,$1);
    830. 

  830. 

  831. 		beh_addtab (dic,$1,BVL_MODNAM,BVL_LBLDFN,1);
    832. 

  832. 		if (BVL_ERRFLG == 0)
    833. 

  833. 		  BVL_BEFPNT->BEMSG->LABEL = $1;
    834. 

  834. 		}
    835. 

  835. 	| unlabeled_concurrent_assertion_statement
    836. 

  836. 	;
    837. 

  837. 

  838. concurrent_signal_assignment_statement
    839. 

  839. 	: a_label
    840. 

  840. 	  unlabeled_conditional_signal_assignment
    841. 

  841. 		{
    842. 

  842. 		if (beh_chktab (dic,$1,BVL_MODNAM,BVL_LBLDFN) != 0)
    843. 

  843. 		  bvl_error (19,$1);
    844. 

  844. 		beh_addtab (dic,$1,BVL_MODNAM,BVL_LBLDFN,1);
    845. 

  845. 		}
    846. 

  846. 	| unlabeled_conditional_signal_assignment
    847. 

  847. 	| a_label
    848. 

  848. 	  unlabeled_selected_signal_assignment
    849. 

  849. 		{
    850. 

  850. 		if (beh_chktab (dic,$1,BVL_MODNAM,BVL_LBLDFN) != 0)
    851. 

  851. 		  bvl_error (19,$1);
    852. 

  852. 		beh_addtab (dic,$1,BVL_MODNAM,BVL_LBLDFN,1);
    853. 

  853. 		}
    854. 

  854. 	| unlabeled_selected_signal_assignment
    855. 

  855. 	;
    856. 

  856. 

  857. unlabeled_concurrent_assertion_statement
    858. 

  858. 	: assertion_statement
    859. 

  859. 	;
    860. 

  860. 

  861. assertion_statement
    862. 

  862. 	: ASSERT
    863. 

  863. 	  expression
    864. 

  864. 	  .REPORT__expression.
    865. 

  865. 	  .SEVERITY__expression.
    866. 

  866. 	  Semicolon_ERR
    867. 

  867. 		{
    868. 

  868. 		if (BVL_ERRFLG == 0)
    869. 

  869. 		  {
    870. 

  870. 		  BVL_BEFPNT->BEMSG = beh_addbemsg(BVL_BEFPNT->BEMSG,NULL,$4,
    871. 

  871. 		                                   $3,$2.LIST_ABL->DATA,NULL);
    872. 

  872. 		  }
    873. 

  873. 		}
    874. 

  874. 	;
    875. 

  875. 

  876. unlabeled_conditional_signal_assignment
    877. 

  877. 	: target
    878. 

  878. 	  _LESym
    879. 

  879. 	  .GUARDED.
    880. 

  880. 	  ..waveform__WHEN__condition__ELSE..
    881. 

  881. 	  waveform
    882. 

  882. 	  Semicolon_ERR
    883. 

  883. 		{
    884. 

  884. 		long             i;
    885. 

  885. 		struct beout   *beout_pnt;
    886. 

  886. 		struct bebus   *bebus_pnt;
    887. 

  887. 		struct bereg   *bereg_pnt;
    888. 

  888. 		struct beaux   *beaux_pnt;
    889. 

  889. 		struct bebux   *bebux_pnt;
    890. 

  890. 		struct chain   *abl_pnt;
    891. 

  891. 		struct bvl_expr expr0;
    892. 

  892. 		struct bvl_expr expr1;
    893. 

  893. 		struct bvl_expr expr2;
    894. 

  894. 		struct bvl_expr expr3;
    895. 

  895. 		struct bvl_expr expr4;
    896. 

  896. 		struct bvl_expr expr5;
    897. 

  897. 		struct bvl_expr expr6;
    898. 

  898. 		long             rev_flg = 0;
    899. 

  899. 		long             left_bnd;
    900. 

  900. 		long             right_bnd;
    901. 

  901. 		long             left;
    902. 

  902. 		long             right;
    903. 

  903. 		long             in_bound;
    904. 

  904. 		long             out_bound;
    905. 

  905. 		long             sig_width;
    906. 

  906. 		long             sig_conf;
    907. 

  907. 

  908. 		expr4 = $5;
    909. 

  909. 

  910. 		while (BVL_CNDLST != NULL)
    911. 

  911. 		  {
    912. 

  912. 		  expr5 = *((bvl_ablstr *) BVL_CNDLST->DATA);
    913. 

  913. 		  expr6 = *((bvl_ablstr *) BVL_VALLST->DATA);
    914. 

  914. 

  915. 		  expr0 = bvl_cpyablstr (expr5);
    916. 

  916. 		  expr1 = bvl_crtabl (ABL_NOT , expr5, BVL_EMPSTR,-1,-1);
    917. 

  917. 		  expr5 = expr0;
    918. 

  918. 		  expr2 = bvl_crtabl (ANDM, expr4, expr1     ,-1,-1);
    919. 

  919. 		  expr3 = bvl_crtabl (ANDM, expr6, expr5     ,-1,-1);
    920. 

  920. 		  expr4 = bvl_crtabl (ABL_OR  , expr2, expr3     ,-1,-1);
    921. 

  921. 

  922. 		  BVL_CNDLST = delchain (BVL_CNDLST,BVL_CNDLST);
    923. 

  923. 		  BVL_VALLST = delchain (BVL_VALLST,BVL_VALLST);
    924. 

  924. 		  }
    925. 

  925. 

  926. 		left_bnd  = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_WMNDFN);
    927. 

  927. 		right_bnd = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_WMXDFN);
    928. 

  928. 		sig_conf  = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_SIGDFN);
    929. 

  929. 

  930. 		left  = $1.LEFT;
    931. 

  931. 		right = $1.RIGHT;
    932. 

  932. 

  933. 		if (left_bnd <= right_bnd)
    934. 

  934. 		  {
    935. 

  935. 		  sig_width = right_bnd - left_bnd + 1;
    936. 

  936. 		  if (left <= right)
    937. 

  937. 		    {
    938. 

  938. 		    rev_flg   = 0;
    939. 

  939. 		    in_bound  = right_bnd - right;
    940. 

  940. 		    out_bound = right_bnd - left;
    941. 

  941. 		    if ((left < left_bnd) || (right > right_bnd))
    942. 

  942. 		      bvl_error (36,$1.NAME);
    943. 

  943. 		    }
    944. 

  944. 		  else
    945. 

  945. 		    {
    946. 

  946. 		    rev_flg   = 1;
    947. 

  947. 		    in_bound  = right_bnd - left;
    948. 

  948. 		    out_bound = right_bnd - right;
    949. 

  949. 		    if ((left > right_bnd) || (right < left_bnd))
    950. 

  950. 		      bvl_error (36,$1.NAME);
    951. 

  951. 		    }
    952. 

  952. 		  }
    953. 

  953. 		else
    954. 

  954. 		  {
    955. 

  955. 		  sig_width = left_bnd - right_bnd + 1;
    956. 

  956. 		  if (left <= right)
    957. 

  957. 		    {
    958. 

  958. 		    rev_flg   = 1;
    959. 

  959. 		    in_bound  = left  - right_bnd;
    960. 

  960. 		    out_bound = right - right_bnd;
    961. 

  961. 		    if ((left < right_bnd) || (right > left_bnd))
    962. 

  962. 		      bvl_error (36,$1.NAME);
    963. 

  963. 		    }
    964. 

  964. 		  else
    965. 

  965. 		    {
    966. 

  966. 		    rev_flg   = 0;
    967. 

  967. 		    in_bound  = right - right_bnd;
    968. 

  968. 		    out_bound = left  - right_bnd;
    969. 

  969. 		    if ((left > left_bnd) || (right < right_bnd))
    970. 

  970. 		      bvl_error (36,$1.NAME);
    971. 

  971. 		    }
    972. 

  972. 		  }
    973. 

  973. 

  974. 		if ((out_bound - in_bound + 1) != expr4.WIDTH)
    975. 

  975. 		  bvl_error (35,$1.NAME);
    976. 

  976. 

  977. 		if (rev_flg == 1)
    978. 

  978. 		  expr4.LIST_ABL = reverse (expr4.LIST_ABL);
    979. 

  979. 

  980. 		abl_pnt = expr4.LIST_ABL;
    981. 

  981. 

  982. 		switch (sig_conf)
    983. 

  983. 		  {
    984. 

  984. 		  case (BVL_ICNDFN + BVL_BITDFN + BVL_NORDFN) :
    985. 

  985. 		    bvl_error (21,$1.NAME);
    986. 

  986. 		    break;
    987. 

  987. 

  988. 		  case (BVL_OCNDFN + BVL_BITDFN + BVL_NORDFN) :
    989. 

  989. 		  case (BVL_BCNDFN + BVL_BITDFN + BVL_NORDFN) :
    990. 

  990. 		    if ($3 == BVL_GRDDFN)
    991. 

  991. 		      bvl_error (22,$1.NAME);
    992. 

  992. 		    beout_pnt = (struct beout *)
    993. 

  993. 		                 beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_PNTDFN);
    994. 

  994. 		    if (BVL_ERRFLG == 0)
    995. 

  995. 		      {
    996. 

  996. 		      for (i=0 ; i<sig_width ; i++)
    997. 

  997. 		        {
    998. 

  998. 		        if (i >= in_bound)
    999. 

  999. 		          {
    1000. 

  1000. 		          if (beout_pnt->ABL != NULL)
    1001. 

  1001. 		            bvl_error (39,beout_pnt->NAME);
    1002. 

  1002. 		          else
    1003. 

  1003. 		            beout_pnt->ABL = (struct chain *)abl_pnt->DATA;
    1004. 

  1004. 		          abl_pnt = abl_pnt->NEXT;
    1005. 

  1005. 		          }
    1006. 

  1006. 		        if (i >= out_bound)
    1007. 

  1007. 		          break;
    1008. 

  1008. 		        beout_pnt = beout_pnt->NEXT;
    1009. 

  1009. 		        }
    1010. 

  1010. 		      }
    1011. 

  1011. 		    break;
    1012. 

  1012. 

  1013. 		  case (BVL_OCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1014. 

  1014. 		  case (BVL_OCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1015. 

  1015. 		  case (BVL_BCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1016. 

  1016. 		  case (BVL_BCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1017. 

  1017. 		    if (($3 != BVL_GRDDFN) || (BVL_GRDLST == NULL))
    1018. 

  1018. 		      bvl_error (23,$1.NAME);
    1019. 

  1019. 		    bebus_pnt = (struct bebus *)
    1020. 

  1020. 		                 beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_PNTDFN);
    1021. 

  1021. 		    if (BVL_ERRFLG == 0)
    1022. 

  1022. 		      {
    1023. 

  1023. 		      for (i=0 ; i<sig_width ; i++)
    1024. 

  1024. 		        {
    1025. 

  1025. 		        if (i >= in_bound)
    1026. 

  1026. 		          {
    1027. 

  1027. 		          bebus_pnt->BINODE = beh_addbinode (bebus_pnt->BINODE,
    1028. 

  1028. 		                                             NULL,NULL);
    1029. 

  1029. 		          bebus_pnt->BIABL  = beh_addbiabl  (bebus_pnt->BIABL,
    1030. 

  1030. 		                                             BVL_LBLNAM,
    1031. 

  1031. 		                                             dupablexpr(BVL_GRDLST->DATA) ,
    1032. 

  1032. 		                                             abl_pnt->DATA);
    1033. 

  1033. 		          abl_pnt           = abl_pnt->NEXT;
    1034. 

  1034. 		          }
    1035. 

  1035. 		        if (i >= out_bound)
    1036. 

  1036. 		          break;
    1037. 

  1037. 		        bebus_pnt = bebus_pnt->NEXT;
    1038. 

  1038. 		        }
    1039. 

  1039. 		      }
    1040. 

  1040. 		    break;
    1041. 

  1041. 

  1042. 		  case (BVL_BITDFN + BVL_NORDFN):
    1043. 

  1043. 		    if ($3 == BVL_GRDDFN)
    1044. 

  1044. 		      bvl_error (22,$1.NAME);
    1045. 

  1045. 		    beaux_pnt = (struct beaux *)
    1046. 

  1046. 		                beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_PNTDFN);
    1047. 

  1047. 		    if (BVL_ERRFLG == 0)
    1048. 

  1048. 		      {
    1049. 

  1049. 		      for (i=0 ; i<sig_width ; i++)
    1050. 

  1050. 		        {
    1051. 

  1051. 		        if (i >= in_bound)
    1052. 

  1052. 		          {
    1053. 

  1053. 		          if (beaux_pnt->ABL != NULL)
    1054. 

  1054. 		            bvl_error (39,beaux_pnt->NAME);
    1055. 

  1055. 		          else
    1056. 

  1056. 		            beaux_pnt->ABL = (struct chain *)abl_pnt->DATA;
    1057. 

  1057. 		          abl_pnt = abl_pnt->NEXT;
    1058. 

  1058. 		          }
    1059. 

  1059. 		        if (i >= out_bound)
    1060. 

  1060. 		          break;
    1061. 

  1061. 		        beaux_pnt = beaux_pnt->NEXT;
    1062. 

  1062. 		        }
    1063. 

  1063. 		      }
    1064. 

  1064. 		    break;
    1065. 

  1065. 

  1066. 		  case (BVL_RBIDFN + BVL_REGDFN):
    1067. 

  1067. 		    if (($3 != BVL_GRDDFN) || (BVL_GRDLST == NULL))
    1068. 

  1068. 		      bvl_error (23,$1.NAME);
    1069. 

  1069. 		    bereg_pnt = (struct bereg *)
    1070. 

  1070. 		                beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_PNTDFN);
    1071. 

  1071. 		    if (BVL_ERRFLG == 0)
    1072. 

  1072. 		      {
    1073. 

  1073. 		      for (i=0 ; i<sig_width ; i++)
    1074. 

  1074. 		        {
    1075. 

  1075. 		        if (i >= in_bound)
    1076. 

  1076. 		          {
    1077. 

  1077. 		          bereg_pnt->BINODE = beh_addbinode (bereg_pnt->BINODE,
    1078. 

  1078. 		                                             NULL,NULL);
    1079. 

  1079. 		          bereg_pnt->BIABL  = beh_addbiabl  (bereg_pnt->BIABL,
    1080. 

  1080. 		                                             BVL_LBLNAM,
    1081. 

  1081. 		                                             dupablexpr(BVL_GRDLST->DATA) ,
    1082. 

  1082. 		                                             abl_pnt->DATA);
    1083. 

  1083. 		          abl_pnt           = abl_pnt->NEXT;
    1084. 

  1084. 		          }
    1085. 

  1085. 		        if (i >= out_bound)
    1086. 

  1086. 		          break;
    1087. 

  1087. 		        bereg_pnt = bereg_pnt->NEXT;
    1088. 

  1088. 		        }
    1089. 

  1089. 		      }
    1090. 

  1090. 		    break;
    1091. 

  1091. 

  1092. 		  case (BVL_MUXDFN + BVL_BUSDFN) :
    1093. 

  1093. 		  case (BVL_WORDFN + BVL_BUSDFN) :
    1094. 

  1094. 		    if (($3 != BVL_GRDDFN) || (BVL_GRDLST == NULL))
    1095. 

  1095. 		      bvl_error (23,$1.NAME);
    1096. 

  1096. 		    bebux_pnt = (struct bebux *)
    1097. 

  1097. 		                beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_PNTDFN);
    1098. 

  1098. 		    if (BVL_ERRFLG == 0)
    1099. 

  1099. 		      {
    1100. 

  1100. 		      for (i=0 ; i<sig_width ; i++)
    1101. 

  1101. 		        {
    1102. 

  1102. 		        if (i >= in_bound)
    1103. 

  1103. 		          {
    1104. 

  1104. 		          bebux_pnt->BINODE = beh_addbinode (bebux_pnt->BINODE,
    1105. 

  1105. 		                                             NULL,NULL);
    1106. 

  1106. 		          bebux_pnt->BIABL  = beh_addbiabl  (bebux_pnt->BIABL,
    1107. 

  1107. 		                                             BVL_LBLNAM,
    1108. 

  1108. 		                                             dupablexpr(BVL_GRDLST->DATA) ,
    1109. 

  1109. 		                                             abl_pnt->DATA);
    1110. 

  1110. 		          abl_pnt           = abl_pnt->NEXT;
    1111. 

  1111. 		          }
    1112. 

  1112. 		        if (i >= out_bound)
    1113. 

  1113. 		          break;
    1114. 

  1114. 		        bebux_pnt = bebux_pnt->NEXT;
    1115. 

  1115. 		        }
    1116. 

  1116. 		      }
    1117. 

  1117. 		    break;
    1118. 

  1118. 

  1119. 		  default :
    1120. 

  1120. 		    bvl_error (17,$1.NAME);
    1121. 

  1121. 		    break;
    1122. 

  1122. 		  }
    1123. 

  1123. 		}
    1124. 

  1124. 	;
    1125. 

  1125. 

  1126. ..waveform__WHEN__condition__ELSE..
    1127. 

  1127. 	: /*empty*/
    1128. 

  1128. 	| ..waveform__WHEN__condition__ELSE..
    1129. 

  1129. 	  waveform
    1130. 

  1130. 	  WHEN
    1131. 

  1131. 	  expression
    1132. 

  1132. 	  ELSE
    1133. 

  1133. 		{
    1134. 

  1134. 		struct bvl_expr *expr_pnt;
    1135. 

  1135. 

  1136. 		expr_pnt           = (bvl_ablstr *)mbkalloc(sizeof(bvl_ablstr));
    1137. 

  1137. 		expr_pnt->WIDTH    = $4.WIDTH;
    1138. 

  1138. 		expr_pnt->LIST_ABL = $4.LIST_ABL;
    1139. 

  1139. 		BVL_CNDLST         = addchain (BVL_CNDLST,(char *) expr_pnt);
    1140. 

  1140. 

  1141. 		expr_pnt           = (bvl_ablstr *)mbkalloc(sizeof(bvl_ablstr));
    1142. 

  1142. 		expr_pnt->WIDTH    = $2.WIDTH;
    1143. 

  1143. 		expr_pnt->LIST_ABL = $2.LIST_ABL;
    1144. 

  1144. 		BVL_VALLST         = addchain (BVL_VALLST,(char *) expr_pnt);
    1145. 

  1145. 		}
    1146. 

  1146. 	;
    1147. 

  1147. 

  1148. unlabeled_selected_signal_assignment
    1149. 

  1149. 	: WITH
    1150. 

  1150. 	  expression
    1151. 

  1151. 		{
    1152. 

  1152. 		BVL_SLCEXP = $2;
    1153. 

  1153. 		BVL_BDDPNT = NULL;
    1154. 

  1154. 		}
    1155. 

  1155. 	  SELECT
    1156. 

  1156. 	  target
    1157. 

  1157. 	  _LESym
    1158. 

  1158. 	  .GUARDED.
    1159. 

  1159. 	  waveform__WHEN__choices
    1160. 

  1160. 	  ...waveform__WHEN__choices..
    1161. 

  1161. 	  Semicolon_ERR
    1162. 

  1162. 		{
    1163. 

  1163. 		long             i;
    1164. 

  1164. 		struct beout   *beout_pnt;
    1165. 

  1165. 		struct bebus   *bebus_pnt;
    1166. 

  1166. 		struct bereg   *bereg_pnt;
    1167. 

  1167. 		struct beaux   *beaux_pnt;
    1168. 

  1168. 		struct bebux   *bebux_pnt;
    1169. 

  1169. 		struct chain   *abl_pnt;
    1170. 

  1170. 		struct bvl_expr expr1;
    1171. 

  1171. 		long             rev_flg = 0;
    1172. 

  1172. 		long             left_bnd;
    1173. 

  1173. 		long             right_bnd;
    1174. 

  1174. 		long             left;
    1175. 

  1175. 		long             right;
    1176. 

  1176. 		long             in_bound;
    1177. 

  1177. 		long             out_bound;
    1178. 

  1178. 		long             sig_width;
    1179. 

  1179. 		long             sig_conf;
    1180. 

  1180. 

  1181. 		expr1 = bvl_crtabl (ABL_OR ,$8 ,$9,-1,-1);
    1182. 

  1182. 		if (BVL_BDDPNT != getlogbddnodeone())
    1183. 

  1183. 		  bvl_error (25,NULL);
    1184. 

  1184. 		left_bnd  = beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_WMNDFN);
    1185. 

  1185. 		right_bnd = beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_WMXDFN);
    1186. 

  1186. 		sig_conf  = beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_SIGDFN);
    1187. 

  1187. 

  1188. 		left  = $5.LEFT;
    1189. 

  1189. 		right = $5.RIGHT;
    1190. 

  1190. 		if (left_bnd <= right_bnd)
    1191. 

  1191. 		  {
    1192. 

  1192. 		  sig_width = right_bnd - left_bnd + 1;
    1193. 

  1193. 		  if (left <= right)
    1194. 

  1194. 		    {
    1195. 

  1195. 		    rev_flg   = 0;
    1196. 

  1196. 		    in_bound  = right_bnd - right;
    1197. 

  1197. 		    out_bound = right_bnd - left;
    1198. 

  1198. 		    if ((left < left_bnd) || (right > right_bnd))
    1199. 

  1199. 		      bvl_error (36,$5.NAME);
    1200. 

  1200. 		    }
    1201. 

  1201. 		  else
    1202. 

  1202. 		    {
    1203. 

  1203. 		    rev_flg   = 1;
    1204. 

  1204. 		    in_bound  = right_bnd - left;
    1205. 

  1205. 		    out_bound = right_bnd - right;
    1206. 

  1206. 		    if ((left > right_bnd) || (right < left_bnd))
    1207. 

  1207. 		      bvl_error (36,$5.NAME);
    1208. 

  1208. 		    }
    1209. 

  1209. 		  }
    1210. 

  1210. 		else
    1211. 

  1211. 		  {
    1212. 

  1212. 		  sig_width = left_bnd - right_bnd + 1;
    1213. 

  1213. 		  if (left <= right)
    1214. 

  1214. 		    {
    1215. 

  1215. 		    rev_flg   = 1;
    1216. 

  1216. 		    in_bound  = left  - right_bnd;
    1217. 

  1217. 		    out_bound = right - right_bnd;
    1218. 

  1218. 		    if ((left < right_bnd) || (right > left_bnd))
    1219. 

  1219. 		      bvl_error (36,$5.NAME);
    1220. 

  1220. 		    }
    1221. 

  1221. 		  else
    1222. 

  1222. 		    {
    1223. 

  1223. 		    rev_flg   = 0;
    1224. 

  1224. 		    in_bound  = right - right_bnd;
    1225. 

  1225. 		    out_bound = left  - right_bnd;
    1226. 

  1226. 		    if ((left > left_bnd) || (right < right_bnd))
    1227. 

  1227. 		      bvl_error (36,$5.NAME);
    1228. 

  1228. 		    }
    1229. 

  1229. 		  }
    1230. 

  1230. 

  1231. 		if ((out_bound - in_bound + 1) != expr1.WIDTH)
    1232. 

  1232. 		  bvl_error (35,$5.NAME);
    1233. 

  1233. 

  1234. 		if (rev_flg == 1)
    1235. 

  1235. 		  expr1.LIST_ABL = reverse (expr1.LIST_ABL);
    1236. 

  1236. 

  1237. 		abl_pnt = expr1.LIST_ABL;
    1238. 

  1238. 

  1239. 		switch (sig_conf)
    1240. 

  1240. 		  {
    1241. 

  1241. 		  case (BVL_ICNDFN + BVL_BITDFN + BVL_NORDFN) :
    1242. 

  1242. 		    bvl_error (21,$5.NAME);
    1243. 

  1243. 		    break;
    1244. 

  1244. 

  1245. 		  case (BVL_OCNDFN + BVL_BITDFN + BVL_NORDFN) :
    1246. 

  1246. 		  case (BVL_BCNDFN + BVL_BITDFN + BVL_NORDFN) :
    1247. 

  1247. 		    if ($7 == BVL_GRDDFN)
    1248. 

  1248. 		      bvl_error (22,$5.NAME);
    1249. 

  1249. 		    beout_pnt = (struct beout *)
    1250. 

  1250. 		                beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_PNTDFN);
    1251. 

  1251. 		    if (BVL_ERRFLG == 0)
    1252. 

  1252. 		      {
    1253. 

  1253. 		      for (i=0 ; i<sig_width ; i++)
    1254. 

  1254. 		        {
    1255. 

  1255. 		        if (i >= in_bound)
    1256. 

  1256. 		          {
    1257. 

  1257. 		          if (beout_pnt->ABL != NULL)
    1258. 

  1258. 		            bvl_error (39,beout_pnt->NAME);
    1259. 

  1259. 		          else
    1260. 

  1260. 		            beout_pnt->ABL = (struct chain *)abl_pnt->DATA;
    1261. 

  1261. 		          abl_pnt = abl_pnt->NEXT;
    1262. 

  1262. 		          }
    1263. 

  1263. 		        if (i >= out_bound)
    1264. 

  1264. 		          break;
    1265. 

  1265. 		        beout_pnt = beout_pnt->NEXT;
    1266. 

  1266. 		        }
    1267. 

  1267. 		      }
    1268. 

  1268. 		    break;
    1269. 

  1269. 

  1270. 		  case (BVL_OCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1271. 

  1271. 		  case (BVL_OCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1272. 

  1272. 		  case (BVL_BCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1273. 

  1273. 		  case (BVL_BCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1274. 

  1274. 		    if (($7 != BVL_GRDDFN) || (BVL_GRDLST == NULL))
    1275. 

  1275. 		      bvl_error (23,$5.NAME);
    1276. 

  1276. 		    bebus_pnt = (struct bebus *)
    1277. 

  1277. 		                beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_PNTDFN);
    1278. 

  1278. 		    if (BVL_ERRFLG == 0)
    1279. 

  1279. 		      {
    1280. 

  1280. 		      for (i=0 ; i<sig_width ; i++)
    1281. 

  1281. 		        {
    1282. 

  1282. 		        if (i >= in_bound)
    1283. 

  1283. 		          {
    1284. 

  1284. 		          bebus_pnt->BINODE = beh_addbinode (bebus_pnt->BINODE,
    1285. 

  1285. 		                                             NULL,NULL);
    1286. 

  1286. 		          bebus_pnt->BIABL  = beh_addbiabl  (bebus_pnt->BIABL,
    1287. 

  1287. 		                                             BVL_LBLNAM,
    1288. 

  1288. 		                                             dupablexpr(BVL_GRDLST->DATA) ,
    1289. 

  1289. 		                                             abl_pnt->DATA);
    1290. 

  1290. 		          abl_pnt           = abl_pnt->NEXT;
    1291. 

  1291. 		          }
    1292. 

  1292. 		        if (i >= out_bound)
    1293. 

  1293. 		          break;
    1294. 

  1294. 		        bebus_pnt = bebus_pnt->NEXT;
    1295. 

  1295. 		        }
    1296. 

  1296. 		      }
    1297. 

  1297. 		    break;
    1298. 

  1298. 

  1299. 		  case (BVL_BITDFN + BVL_NORDFN):
    1300. 

  1300. 		    if ($7 == BVL_GRDDFN)
    1301. 

  1301. 		      bvl_error (22,$5.NAME);
    1302. 

  1302. 		    beaux_pnt = (struct beaux *)
    1303. 

  1303. 		                beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_PNTDFN);
    1304. 

  1304. 		    if (BVL_ERRFLG == 0)
    1305. 

  1305. 		      {
    1306. 

  1306. 		      for (i=0 ; i<sig_width ; i++)
    1307. 

  1307. 		        {
    1308. 

  1308. 		        if (i >= in_bound)
    1309. 

  1309. 		          {
    1310. 

  1310. 		          if (beaux_pnt->ABL != NULL)
    1311. 

  1311. 		            bvl_error (39,beaux_pnt->NAME);
    1312. 

  1312. 		          else
    1313. 

  1313. 		           {
    1314. 

  1314. 		            beaux_pnt->ABL = (struct chain *)abl_pnt->DATA;
    1315. 

  1315. 		            }
    1316. 

  1316. 		          abl_pnt = abl_pnt->NEXT;
    1317. 

  1317. 		          }
    1318. 

  1318. 		        if (i >= out_bound)
    1319. 

  1319. 		          break;
    1320. 

  1320. 		        beaux_pnt = beaux_pnt->NEXT;
    1321. 

  1321. 		        }
    1322. 

  1322. 		      }
    1323. 

  1323. 		    break;
    1324. 

  1324. 

  1325. 		  case (BVL_RBIDFN + BVL_REGDFN):
    1326. 

  1326. 		    if (($7 != BVL_GRDDFN) || (BVL_GRDLST == NULL))
    1327. 

  1327. 		      bvl_error (23,$5.NAME);
    1328. 

  1328. 		    bereg_pnt = (struct bereg *)
    1329. 

  1329. 		                beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_PNTDFN);
    1330. 

  1330. 		    if (BVL_ERRFLG == 0)
    1331. 

  1331. 		      {
    1332. 

  1332. 		      for (i=0 ; i<sig_width ; i++)
    1333. 

  1333. 		        {
    1334. 

  1334. 		        if (i >= in_bound)
    1335. 

  1335. 		          {
    1336. 

  1336. 		          bereg_pnt->BINODE = beh_addbinode (bereg_pnt->BINODE,
    1337. 

  1337. 		                                             NULL,NULL);
    1338. 

  1338. 		          bereg_pnt->BIABL  = beh_addbiabl  (bereg_pnt->BIABL,
    1339. 

  1339. 		                                             BVL_LBLNAM,
    1340. 

  1340. 		                                             dupablexpr(BVL_GRDLST->DATA) ,
    1341. 

  1341. 		                                             abl_pnt->DATA);
    1342. 

  1342. 		          abl_pnt           = abl_pnt->NEXT;
    1343. 

  1343. 		          }
    1344. 

  1344. 		        if (i >= out_bound)
    1345. 

  1345. 		          break;
    1346. 

  1346. 		        bereg_pnt = bereg_pnt->NEXT;
    1347. 

  1347. 		        }
    1348. 

  1348. 		      }
    1349. 

  1349. 		    break;
    1350. 

  1350. 

  1351. 		  case (BVL_MUXDFN + BVL_BUSDFN) :
    1352. 

  1352. 		  case (BVL_WORDFN + BVL_BUSDFN) :
    1353. 

  1353. 		    if (($7 != BVL_GRDDFN) || (BVL_GRDLST == NULL))
    1354. 

  1354. 		      bvl_error (23,$5.NAME);
    1355. 

  1355. 		    bebux_pnt = (struct bebux *)
    1356. 

  1356. 		                beh_chktab (dic,$5.NAME,BVL_MODNAM,BVL_PNTDFN);
    1357. 

  1357. 		    if (BVL_ERRFLG == 0)
    1358. 

  1358. 		      {
    1359. 

  1359. 		      for (i=0 ; i<sig_width ; i++)
    1360. 

  1360. 		        {
    1361. 

  1361. 		        if (i >= in_bound)
    1362. 

  1362. 		          {
    1363. 

  1363. 		          bebux_pnt->BINODE = beh_addbinode (bebux_pnt->BINODE,
    1364. 

  1364. 		                                             NULL,NULL);
    1365. 

  1365. 		          bebux_pnt->BIABL  = beh_addbiabl  (bebux_pnt->BIABL,
    1366. 

  1366. 		                                             BVL_LBLNAM,
    1367. 

  1367. 		                                             dupablexpr(BVL_GRDLST->DATA) ,
    1368. 

  1368. 		                                             abl_pnt->DATA);
    1369. 

  1369. 		          abl_pnt           = abl_pnt->NEXT;
    1370. 

  1370. 		          }
    1371. 

  1371. 		        if (i >= out_bound)
    1372. 

  1372. 		          break;
    1373. 

  1373. 		        bebux_pnt = bebux_pnt->NEXT;
    1374. 

  1374. 		        }
    1375. 

  1375. 		      }
    1376. 

  1376. 		    break;
    1377. 

  1377. 

  1378. 		  default :
    1379. 

  1379. 		    bvl_error (17,$5.NAME);
    1380. 

  1380. 		    break;
    1381. 

  1381. 		  }
    1382. 

  1382. 		}
    1383. 

  1383. 	;
    1384. 

  1384. 

  1385. ...waveform__WHEN__choices..
    1386. 

  1386. 	: /*empty*/
    1387. 

  1387. 		{ $$ = BVL_EMPSTR; }
    1388. 

  1388. 	| ...waveform__WHEN__choices..
    1389. 

  1389. 	  Comma
    1390. 

  1390. 	  waveform__WHEN__choices
    1391. 

  1391. 		{ $$ = bvl_crtabl (ABL_OR,$1,$3,-1,-1); }
    1392. 

  1392. 	;
    1393. 

  1393. 

  1394. waveform__WHEN__choices
    1395. 

  1395. 	: waveform
    1396. 

  1396. 	  WHEN
    1397. 

  1397. 	  choices
    1398. 

  1398. 		{
    1399. 

  1399. 		struct bvl_expr expr1;
    1400. 

  1400. 

  1401. 		bvl_select (&expr1,BVL_NM1LST,&BVL_BDDPNT,BVL_SLCEXP);
    1402. 

  1402. 		freechain (BVL_NM1LST);
    1403. 

  1403. 		BVL_NM1LST = NULL;
    1404. 

  1404. 

  1405. 		$$ = bvl_crtabl (ANDM,$1,expr1,-1,-1);
    1406. 

  1406. 		}
    1407. 

  1407. 	;
    1408. 

  1408. 

  1409. waveform
    1410. 

  1410. 	: waveform_element
    1411. 

  1411. 		{ $$ = $1; }
    1412. 

  1412. 	;
    1413. 

  1413. 

  1414. waveform_element
    1415. 

  1415. 	: expression
    1416. 

  1416. 	  .AFTER__delay_expression.
    1417. 

  1417. 		{
    1418. 

  1418. 		$$      = $1;
    1419. 

  1419. 		}
    1420. 

  1420. 	;
    1421. 

  1421. 

  1422. .AFTER__delay_expression.
    1423. 

  1423. 	: /*empty*/
    1424. 

  1424. 		{}
    1425. 

  1425. 	| AFTER
    1426. 

  1426. 	  delay_expression
    1427. 

  1427. 		{}
    1428. 

  1428. 	;
    1429. 

  1429. 

  1430. delay_expression
    1431. 

  1431. 	: abstractlit
    1432. 

  1432. 	 .time_unit.
    1433. 

  1433. 		{}
    1434. 

  1434. 	;
    1435. 

  1435. 

  1436. .time_unit.
    1437. 

  1437. 	: /*empty*/
    1438. 

  1438. 		{}
    1439. 

  1439. 	| _PS
    1440. 

  1440. 		{}
    1441. 

  1441. 	| _NS
    1442. 

  1442. 		{}
    1443. 

  1443. 	| _US
    1444. 

  1444. 		{}
    1445. 

  1445. 	| _MS
    1446. 

  1446. 		{}
    1447. 

  1447. 	;
    1448. 

  1448. 

  1449. choices
    1450. 

  1450. 	: choice
    1451. 

  1451. 		{ BVL_NM1LST = addchain (NULL ,$1); }
    1452. 

  1452. 	  ..Bar__choice..
    1453. 

  1453. 		{ yyerrok; }
    1454. 

  1454. 	;
    1455. 

  1455. 

  1456. ..Bar__choice..
    1457. 

  1457. 	: /*empty*/
    1458. 

  1458. 	| ..Bar__choice..
    1459. 

  1459. 	  Bar
    1460. 

  1460. 	  choice
    1461. 

  1461. 		{
    1462. 

  1462. 		if ($3 == "others")
    1463. 

  1463. 		  bvl_error (30,NULL);
    1464. 

  1464. 		BVL_NM1LST = addchain (BVL_NM1LST ,$3);
    1465. 

  1465. 		}
    1466. 

  1466. 	;
    1467. 

  1467. 

  1468. choice
    1469. 

  1469. 	: literal
    1470. 

  1470. 		{ $$ = $1; }
    1471. 

  1471. 	| OTHERS
    1472. 

  1472. 		{ $$ = "others"; }
    1473. 

  1473. 	| name
    1474. 

  1474. 		{
    1475. 

  1475. 		char           *val;
    1476. 

  1476. 		char            val2[256];
    1477. 

  1477. 		long             left;
    1478. 

  1478. 		long             right;
    1479. 

  1479. 		long             in_bound;
    1480. 

  1480. 		long             out_bound;
    1481. 

  1481. 		long             left_bnd;
    1482. 

  1482. 		long             right_bnd;
    1483. 

  1483. 		long             sig_conf;
    1484. 

  1484. 

  1485. 		strcpy (val2,"B\"");
    1486. 

  1486. 		sig_conf = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_SIGDFN);
    1487. 

  1487. 		val      = (char *) beh_chktab (dic,$1.NAME,NULL,BVL_PNTDFN);
    1488. 

  1488. 		if (sig_conf == 0)
    1489. 

  1489. 		  bvl_error (17,$1.NAME);
    1490. 

  1490. 		else
    1491. 

  1491. 		  {
    1492. 

  1492. 		  if (sig_conf != BVL_CSTDFN)
    1493. 

  1493. 		    bvl_error (76,$1.NAME);
    1494. 

  1494. 		  }
    1495. 

  1495. 

  1496. 		left_bnd  = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_WMNDFN);
    1497. 

  1497. 		right_bnd = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_WMXDFN);
    1498. 

  1498. 

  1499. 		left  = $1.LEFT;
    1500. 

  1500. 		right = $1.RIGHT;
    1501. 

  1501. 

  1502. 		if (left_bnd <= right_bnd)
    1503. 

  1503. 		  {
    1504. 

  1504. 		  if (left <= right)
    1505. 

  1505. 		    {
    1506. 

  1506. 		    in_bound = left - left_bnd;
    1507. 

  1507. 		    out_bound = right - left_bnd;
    1508. 

  1508. 		    if ((left < left_bnd) || (right > right_bnd))
    1509. 

  1509. 		      bvl_error (36,$1.NAME);
    1510. 

  1510. 		    }
    1511. 

  1511. 		  else
    1512. 

  1512. 		    {
    1513. 

  1513. 		    in_bound = left - right_bnd;
    1514. 

  1514. 		    out_bound = right - right_bnd;
    1515. 

  1515. 		    if ((left > right_bnd) || (right < left_bnd))
    1516. 

  1516. 		      bvl_error (36,$1.NAME);
    1517. 

  1517. 		    }
    1518. 

  1518. 		  }
    1519. 

  1519. 		else
    1520. 

  1520. 		  {
    1521. 

  1521. 		  if (left <= right)
    1522. 

  1522. 		    {
    1523. 

  1523. 		    in_bound = right - left_bnd;
    1524. 

  1524. 		    out_bound = left - left_bnd;
    1525. 

  1525. 		    if ((left < right_bnd) || (right > left_bnd))
    1526. 

  1526. 		      bvl_error (36,$1.NAME);
    1527. 

  1527. 		    }
    1528. 

  1528. 		  else
    1529. 

  1529. 		    {
    1530. 

  1530. 		    in_bound = right - right_bnd;
    1531. 

  1531. 		    out_bound = left - right_bnd;
    1532. 

  1532. 		    if ((left > left_bnd) || (right < right_bnd))
    1533. 

  1533. 		      bvl_error (36,$1.NAME);
    1534. 

  1534. 		    }
    1535. 

  1535. 		  }
    1536. 

  1536. 

  1537. 		bvl_tobin (&val2[2],val,in_bound,out_bound);
    1538. 

  1538. 		strcat (val2,"\"");
    1539. 

  1539. 		$$ = namealloc (val2);
    1540. 

  1540. 		}
    1541. 

  1541. 	;
    1542. 

  1542. 

  1543. .REPORT__expression.
    1544. 

  1544. 	: /*empty*/
    1545. 

  1545. 		{ $$ = NULL; }
    1546. 

  1546. 	| REPORT
    1547. 

  1547. 	  report__message
    1548. 

  1548. 		{ $$ = $2; }
    1549. 

  1549. 	;
    1550. 

  1550. 

  1551. .SEVERITY__expression.
    1552. 

  1552. 	: /*empty*/
    1553. 

  1553. 		{ $$ = 'E'; }
    1554. 

  1554. 	| SEVERITY
    1555. 

  1555. 	  severity__message
    1556. 

  1556. 		{ $$ = $2; }
    1557. 

  1557. 	;
    1558. 

  1558. 

  1559. report__message
    1560. 

  1560. 	: StringLit
    1561. 

  1561. 		{ $$ = $1; }
    1562. 

  1562. 	;
    1563. 

  1563. 

  1564. severity__message
    1565. 

  1565. 	: ERROR
    1566. 

  1566. 		{ $$ = 'E'; }
    1567. 

  1567. 	| WARNING
    1568. 

  1568. 		{ $$ = 'W'; }
    1569. 

  1569. 	;
    1570. 

  1570. 

  1571. expression
    1572. 

  1572. 	: relation..AND__relation..
    1573. 

  1573. 		{ $$ = $1; }
    1574. 

  1574. 	| relation..OR__relation..
    1575. 

  1575. 		{ $$ = $1; }
    1576. 

  1576. 	| relation.NAND_NOR__relation.
    1577. 

  1577. 		{ $$ = $1; }
    1578. 

  1578. 	| relation..XOR__relation..
    1579. 

  1579. 		{ $$ = $1; }
    1580. 

  1580. 	;
    1581. 

  1581. 

  1582. relation..AND__relation..
    1583. 

  1583. 	: relation
    1584. 

  1584. 	  tok_AND
    1585. 

  1585. 	  relation
    1586. 

  1586. 		{ $$ = bvl_crtabl (ABL_AND ,$1 ,$3 ,-1,-1); }
    1587. 

  1587. 	| relation..AND__relation..
    1588. 

  1588. 	  tok_AND
    1589. 

  1589. 	  relation
    1590. 

  1590. 		{ $$ = bvl_crtabl (ABL_AND ,$1 ,$3 ,-1,-1); }
    1591. 

  1591. 	;
    1592. 

  1592. 

  1593. relation..OR__relation..
    1594. 

  1594. 	: relation
    1595. 

  1595. 	  _OR
    1596. 

  1596. 	  relation
    1597. 

  1597. 		{ $$ = bvl_crtabl (ABL_OR ,$1 ,$3 ,-1,-1); }
    1598. 

  1598. 	| relation..OR__relation..
    1599. 

  1599. 	  _OR
    1600. 

  1600. 	  relation
    1601. 

  1601. 		{ $$ = bvl_crtabl (ABL_OR ,$1 ,$3 ,-1,-1); }
    1602. 

  1602. 	;
    1603. 

  1603. 

  1604. relation.NAND_NOR__relation.
    1605. 

  1605. 	: relation
    1606. 

  1606. 		{ $$ = $1; }
    1607. 

  1607. 	| relation
    1608. 

  1608. 	  _NAND
    1609. 

  1609. 	  relation
    1610. 

  1610. 		{ $$ = bvl_crtabl (ABL_NAND ,$1 ,$3 ,-1,-1); }
    1611. 

  1611. 	| relation
    1612. 

  1612. 	  _NOR
    1613. 

  1613. 	  relation
    1614. 

  1614. 		{ $$ = bvl_crtabl (ABL_NOR ,$1 ,$3 ,-1,-1); }
    1615. 

  1615. 	;
    1616. 

  1616. 

  1617. 

  1618. relation..XOR__relation..
    1619. 

  1619. 	: relation
    1620. 

  1620. 	  _XOR
    1621. 

  1621. 	  relation
    1622. 

  1622. 		{ $$ = bvl_crtabl (ABL_XOR ,$1 ,$3 ,-1,-1); }
    1623. 

  1623. 	| relation..XOR__relation..
    1624. 

  1624. 	  _XOR
    1625. 

  1625. 	  relation
    1626. 

  1626. 		{ $$ = bvl_crtabl (ABL_XOR ,$1 ,$3 ,-1,-1); }
    1627. 

  1627. 	;
    1628. 

  1628. 

  1629. relation
    1630. 

  1630. 	: simple_expression
    1631. 

  1631. 		{ $$ = $1; }
    1632. 

  1632. 	| simple_expression
    1633. 

  1633. 	  relational_operator
    1634. 

  1634. 	  simple_expression
    1635. 

  1635. 		{ $$ = bvl_crtabl ($2 ,$1 ,$3 ,-1,-1); }
    1636. 

  1636. 	;
    1637. 

  1637. 

  1638. simple_expression
    1639. 

  1639. 	: .sign.term..add_op__term..
    1640. 

  1640. 		{ $$ = $1; }
    1641. 

  1641. 	;
    1642. 

  1642. 

  1643. .sign.term..add_op__term..
    1644. 

  1644. 	: term
    1645. 

  1645. 		{ $$ = $1; }
    1646. 

  1646. 	| .sign.term..add_op__term..
    1647. 

  1647. 	  Ampersand
    1648. 

  1648. 	  term
    1649. 

  1649. 		{ $$ = bvl_crtabl (CONC,$1,$3,-1,-1); }
    1650. 

  1650. 

  1651. 	;
    1652. 

  1652. 

  1653. term
    1654. 

  1654. 	: factor
    1655. 

  1655. 		{ $$ = $1; }
    1656. 

  1656. 	;
    1657. 

  1657. 

  1658. factor
    1659. 

  1659. 	: primary
    1660. 

  1660. 		{ $$ = $1; }
    1661. 

  1661. 	| _NOT
    1662. 

  1662. 	  primary
    1663. 

  1663. 		{ $$ = bvl_crtabl (ABL_NOT,$2,BVL_EMPSTR,-1,-1); }
    1664. 

  1664. 	;
    1665. 

  1665. 

  1666. primary
    1667. 

  1667. 	: literal
    1668. 

  1668. 		{
    1669. 

  1669. 		struct bvl_expr expr1;
    1670. 

  1670. 		expr1.IDENT = $1;
    1671. 

  1671. 		$$ = bvl_crtabl (NOPS,expr1,BVL_EMPSTR,-1,-1);
    1672. 

  1672. 		}
    1673. 

  1673. 	| aggregate
    1674. 

  1674. 		{ $$ = $1; }
    1675. 

  1675. 	| name
    1676. 

  1676. 		{
    1677. 

  1677. 		struct bvl_expr expr1;
    1678. 

  1678. 		long             left;
    1679. 

  1679. 		long             right;
    1680. 

  1680. 		long             left_bnd;
    1681. 

  1681. 		long             right_bnd;
    1682. 

  1682. 		long             in_bound;
    1683. 

  1683. 		long             out_bound;
    1684. 

  1684. 		long             sig_conf;
    1685. 

  1685. 

  1686. 		sig_conf = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_SIGDFN);
    1687. 

  1687. 		switch (sig_conf)
    1688. 

  1688. 		  {
    1689. 

  1689. 		  case (BVL_ICNDFN + BVL_BITDFN + BVL_NORDFN) :
    1690. 

  1690. 		  case (BVL_BCNDFN + BVL_BITDFN + BVL_NORDFN) :
    1691. 

  1691. 		  case (BVL_BCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1692. 

  1692. 		  case (BVL_BCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1693. 

  1693. 		  case (BVL_BITDFN + BVL_NORDFN):
    1694. 

  1694. 		  case (BVL_MUXDFN + BVL_BUSDFN):
    1695. 

  1695. 		  case (BVL_WORDFN + BVL_BUSDFN):
    1696. 

  1696. 		  case (BVL_RBIDFN + BVL_REGDFN):
    1697. 

  1697. 		  case (BVL_CSTDFN):
    1698. 

  1698. 		    break;
    1699. 

  1699. 		  case (BVL_OCNDFN + BVL_BITDFN + BVL_NORDFN) :
    1700. 

  1700. 		  case (BVL_OCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1701. 

  1701. 		  case (BVL_OCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1702. 

  1702. 		    bvl_error (26,$1.NAME);
    1703. 

  1703. 		    break;
    1704. 

  1704. 		  default :
    1705. 

  1705. 		    bvl_error (17,$1.NAME);
    1706. 

  1706. 		    break;
    1707. 

  1707. 		  }
    1708. 

  1708. 

  1709. 		left_bnd  = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_WMNDFN);
    1710. 

  1710. 		right_bnd = beh_chktab (dic,$1.NAME,BVL_MODNAM,BVL_WMXDFN);
    1711. 

  1711. 

  1712. 		left  = $1.LEFT;
    1713. 

  1713. 		right = $1.RIGHT;
    1714. 

  1714. 

  1715. 		if (left_bnd <= right_bnd)
    1716. 

  1716. 		  {
    1717. 

  1717. 		  if (left <= right)
    1718. 

  1718. 		    {
    1719. 

  1719. 		    in_bound  = left  - left_bnd;
    1720. 

  1720. 		    out_bound = right - left_bnd;
    1721. 

  1721. 		    if ((left < left_bnd) || (right > right_bnd))
    1722. 

  1722. 		      bvl_error (36,$1.NAME);
    1723. 

  1723. 		    }
    1724. 

  1724. 		  else
    1725. 

  1725. 		    {
    1726. 

  1726. 		    in_bound  = right - left_bnd;
    1727. 

  1727. 		    out_bound = left  - left_bnd;
    1728. 

  1728. 		    if ((left > right_bnd) || (right < left_bnd))
    1729. 

  1729. 		      bvl_error (36,$1.NAME);
    1730. 

  1730. 		    }
    1731. 

  1731. 		  }
    1732. 

  1732. 		else
    1733. 

  1733. 		  {
    1734. 

  1734. 		  if (left <= right)
    1735. 

  1735. 		    {
    1736. 

  1736. 		    in_bound  = left  - right_bnd;
    1737. 

  1737. 		    out_bound = right - right_bnd;
    1738. 

  1738. 		    if ((left < right_bnd) || (right > left_bnd))
    1739. 

  1739. 		      bvl_error (36,$1.NAME);
    1740. 

  1740. 		    }
    1741. 

  1741. 		  else
    1742. 

  1742. 		    {
    1743. 

  1743. 		    in_bound  = right - right_bnd;
    1744. 

  1744. 		    out_bound = left  - right_bnd;
    1745. 

  1745. 		    if ((left > left_bnd) || (right < right_bnd))
    1746. 

  1746. 		      bvl_error (36,$1.NAME);
    1747. 

  1747. 		    }
    1748. 

  1748. 		  }
    1749. 

  1749. 

  1750. 		if (sig_conf != BVL_CSTDFN)
    1751. 

  1751. 		  {
    1752. 

  1752. 		  expr1.IDENT = $1.NAME;
    1753. 

  1753. 		  if($1.FLAG == 'X')
    1754. 

  1754. 			{
    1755. 

  1755. 		  	expr1 = bvl_crtabl (NOPI,expr1,BVL_EMPSTR,left,right);
    1756. 

  1756. 		  	$$ = bvl_crtabl (ABL_STABLE,expr1,BVL_EMPSTR,left,right);
    1757. 

  1757. 			}
    1758. 

  1758. 		  else 
    1759. 

  1759. 		  	$$ = bvl_crtabl (NOPI,expr1,BVL_EMPSTR,left,right);
    1760. 

  1760. 		  }
    1761. 

  1761. 		else
    1762. 

  1762. 		  {
    1763. 

  1763. 		  expr1.IDENT = (char *)beh_chktab(dic,$1.NAME,NULL,BVL_PNTDFN);
    1764. 

  1764. 		  $$ = bvl_crtabl (NOPS,expr1,BVL_EMPSTR,in_bound,out_bound);
    1765. 

  1765. 		  }
    1766. 

  1766. 		}
    1767. 

  1767. 	;
    1768. 

  1768. 

  1769. relational_operator
    1770. 

  1770. 	: _EQSym
    1771. 

  1771. 		{ $$ = EQ; }
    1772. 

  1772. 	| _NESym
    1773. 

  1773. 		{ $$ = NE; }
    1774. 

  1774. 	;
    1775. 

  1775. 

  1776. literal
    1777. 

  1777. 	: CharacterLit
    1778. 

  1778. 		{ $$ = $1; }
    1779. 

  1779. 	| StringLit
    1780. 

  1780. 		{ $$ = $1; }
    1781. 

  1781. 	| BitStringLit
    1782. 

  1782. 		{ $$ = $1; }
    1783. 

  1783. 	;
    1784. 

  1784. 

  1785. aggregate
    1786. 

  1786. 	: LeftParen
    1787. 

  1787. 	  expression
    1788. 

  1788. 	  RightParen
    1789. 

  1789. 		{ $$ = $2; }
    1790. 

  1790. 	;
    1791. 

  1791. 

  1792. name
    1793. 

  1793. 	: simple_name
    1794. 

  1794. 		{
    1795. 

  1795. 		$$.NAME  = $1;
    1796. 

  1796. 		$$.LEFT  = beh_chktab (dic,$1,BVL_MODNAM,BVL_WMNDFN);
    1797. 

  1797. 		$$.RIGHT = beh_chktab (dic,$1,BVL_MODNAM,BVL_WMXDFN);
    1798. 

  1798. 		}
    1799. 

  1799. 	| indexed_name
    1800. 

  1800. 		{ $$ = $1; }
    1801. 

  1801. 	| slice_name
    1802. 

  1802. 		{ $$ = $1; }
    1803. 

  1803. 	| attribute_name
    1804. 

  1804. 		{ $$ = $1; }
    1805. 

  1805. 	;
    1806. 

  1806. 

  1807. indexed_name
    1808. 

  1808. 	: simple_name
    1809. 

  1809. 	  LeftParen
    1810. 

  1810. 	  abstractlit
    1811. 

  1811. 	  RightParen_ERR
    1812. 

  1812. 		{
    1813. 

  1813. 		$$.NAME  = $1;
    1814. 

  1814. 		$$.LEFT  = $3;
    1815. 

  1815. 		$$.RIGHT = $3;
    1816. 

  1816. 		}
    1817. 

  1817. 	;
    1818. 

  1818. 

  1819. slice_name
    1820. 

  1820. 	: simple_name
    1821. 

  1821. 	  LeftParen
    1822. 

  1822. 	  abstractlit
    1823. 

  1823. 	  direction
    1824. 

  1824. 	  abstractlit
    1825. 

  1825. 	  RightParen_ERR
    1826. 

  1826. 		{
    1827. 

  1827. 		if ((($5 > $3) && ($4 != BVL_UPTDFN)) ||
    1828. 

  1828. 		    (($5 < $3) && ($4 != BVL_DWTDFN)))
    1829. 

  1829. 		  bvl_error (32,$1);
    1830. 

  1830. 

  1831. 		$$.NAME  = $1;
    1832. 

  1832. 		$$.LEFT  = $3;
    1833. 

  1833. 		$$.RIGHT = $5;
    1834. 

  1834. 		}
    1835. 

  1835. 	;
    1836. 

  1836. 

  1837. attribute_name
    1838. 

  1838. 	: simple_name
    1839. 

  1839. 	  Apostrophe
    1840. 

  1840. 	  attribute_designator
    1841. 

  1841. 		{
    1842. 

  1842. 		char             extname[100];
    1843. 

  1843. 		char            *lclname;
    1844. 

  1844. 		long              sig_conf;
    1845. 

  1845. 		struct bvl_expr  expr1;
    1846. 

  1846. 		struct bvl_expr  expr2;
    1847. 

  1847. 		struct chain    *ptabl;
    1848. 

  1848. 

  1849. 		sig_conf = beh_chktab (dic,$1,BVL_MODNAM,BVL_SIGDFN);
    1850. 

  1850. 		switch (sig_conf)
    1851. 

  1851. 		  {
    1852. 

  1852. 		  case (BVL_ICNDFN + BVL_BITDFN + BVL_NORDFN) :
    1853. 

  1853. 		  case (BVL_BCNDFN + BVL_BITDFN + BVL_NORDFN) :
    1854. 

  1854. 		  case (BVL_BCNDFN + BVL_MUXDFN + BVL_BUSDFN) :
    1855. 

  1855. 		  case (BVL_BCNDFN + BVL_WORDFN + BVL_BUSDFN) :
    1856. 

  1856. 		  case (BVL_BITDFN + BVL_NORDFN):
    1857. 

  1857. 		  case (BVL_MUXDFN + BVL_BUSDFN):
    1858. 

  1858. 		  case (BVL_WORDFN + BVL_BUSDFN):
    1859. 

  1859. 		  case (BVL_RBIDFN + BVL_REGDFN):
    1860. 

  1860. 		    break;
    1861. 

  1861. 		  default :
    1862. 

  1862. 		    bvl_error (79,$1);
    1863. 

  1863. 		  }
    1864. 

  1864. 

  1865. 		if (beh_chktab (dic,$1,BVL_MODNAM,BVL_WMNDFN) != -1)
    1866. 

  1866. 		  bvl_error (79,$1);
    1867. 

  1867. 

  1868. 		sprintf (extname,"%s'delayed",$1);
    1869. 

  1869. 		lclname = namealloc (extname);
    1870. 

  1870. 

  1871. 		if (BVL_ERRFLG == 0)
    1872. 

  1872. 		  {
    1873. 

  1873. 		  if (beh_chktab (dic,$1,BVL_MODNAM,BVL_STBDFN) == 0)
    1874. 

  1874. 		    {
    1875. 

  1875. 		    expr1.IDENT = $1;
    1876. 

  1876. 		    expr1.WIDTH  = 1;
    1877. 

  1877. 		    expr2 = bvl_crtabl (NOPI,expr1,BVL_EMPSTR,-1,-1);
    1878. 

  1878. 		    ptabl = expr2.LIST_ABL->DATA;
    1879. 

  1879. 

  1880. 		    if (BVL_AUXMOD == 1)
    1881. 

  1881. 		      BVL_BEFPNT->BERIN=beh_addberin(BVL_BEFPNT->BERIN,lclname);
    1882. 

  1882. 

  1883. 		    BVL_BEFPNT->BEDLY = beh_addbeaux(BVL_BEFPNT->BEDLY,lclname,
    1884. 

  1884. 		                                     ptabl,NULL);
    1885. 

  1885. 		    beh_addtab (dic,$1     ,BVL_MODNAM,BVL_STBDFN,1);
    1886. 

  1886. 		    beh_addtab (dic,lclname,BVL_MODNAM,BVL_WMNDFN,-1);
    1887. 

  1887. 		    beh_addtab (dic,lclname,BVL_MODNAM,BVL_WMXDFN,-1);
    1888. 

  1888. 		    beh_addtab (dic,lclname,BVL_MODNAM,BVL_SIGDFN,
    1889. 

  1889. 		                (BVL_ICNDFN + BVL_BITDFN + BVL_NORDFN));
    1890. 

  1890. 		    }
    1891. 

  1891. 		  }
    1892. 

  1892. 		BVL_BEFPNT->TYPE |= BEH_STABLE;
    1893. 

  1893. 		$$.NAME = $1;
    1894. 

  1894. 		$$.LEFT = -1;
    1895. 

  1895. 		$$.RIGHT = -1;
    1896. 

  1896. 		$$.FLAG  = 'X';
    1897. 

  1897. 

  1898. 		}
    1899. 

  1899. 	;
    1900. 

  1900. 

  1901. attribute_designator
    1902. 

  1902. 	: _STABLE
    1903. 

  1903. 	;
    1904. 

  1904. 

  1905. type_mark
    1906. 

  1906. 	: BIT
    1907. 

  1907. 		{ $$.VALU = BIT; $$.FLAG = 'S'; }
    1908. 

  1908. 	| WOR_BIT
    1909. 

  1909. 		{ $$.VALU = WOR_BIT; $$.FLAG = 'S'; }
    1910. 

  1910. 	| MUX_BIT
    1911. 

  1911. 		{ $$.VALU = MUX_BIT; $$.FLAG = 'S'; }
    1912. 

  1912. 	| BIT_VECTOR
    1913. 

  1913. 		{ $$.VALU = BIT; $$.FLAG = 'A'; }
    1914. 

  1914. 	| WOR_VECTOR
    1915. 

  1915. 		{ $$.VALU = WOR_BIT; $$.FLAG = 'A'; }
    1916. 

  1916. 	| MUX_VECTOR
    1917. 

  1917. 		{ $$.VALU = MUX_BIT; $$.FLAG = 'A'; }
    1918. 

  1918. 	| REG_BIT
    1919. 

  1919. 		{ $$.VALU = REG_BIT; $$.FLAG = 'S'; }
    1920. 

  1920. 	| REG_VECTOR
    1921. 

  1921. 		{ $$.VALU = REG_BIT; $$.FLAG = 'A'; }
    1922. 

  1922. 	| NATURAL
    1923. 

  1923. 		{ $$.VALU = NATURAL; $$.FLAG = 'S'; }
    1924. 

  1924. 	| NATURAL_VECTOR
    1925. 

  1925. 		{ $$.VALU = NATURAL; $$.FLAG = 'A'; }
    1926. 

  1926. 	;
    1927. 

  1927. 

  1928. identifier_list
    1929. 

  1929. 	: Identifier
    1930. 

  1930. 		{ BVL_NM1LST = addchain (BVL_NM1LST,$1); }
    1931. 

  1931. 	  ...identifier..
    1932. 

  1932. 	;
    1933. 

  1933. 

  1934. ...identifier..
    1935. 

  1935. 	: /*empty*/
    1936. 

  1936. 	| ...identifier..
    1937. 

  1937. 	  Comma
    1938. 

  1938. 	  Identifier
    1939. 

  1939. 		{ BVL_NM1LST = addchain (BVL_NM1LST,$3); }
    1940. 

  1940. 	;
    1941. 

  1941. 

  1942. .label.
    1943. 

  1943. 	: /*empty*/
    1944. 

  1944. 		{ $$ = NULL; }
    1945. 

  1945. 	| label
    1946. 

  1946. 		{ $$ = $1; }
    1947. 

  1947. 	;
    1948. 

  1948. 

  1949. .guard_expression.
    1950. 

  1950. 	: /*empty*/
    1951. 

  1951. 		{ $$ = NULL; }
    1952. 

  1952. 	| guard_expression
    1953. 

  1953. 		{ $$ = $1; }
    1954. 

  1954. 	;
    1955. 

  1955. 

  1956. guard_expression
    1957. 

  1957. 	: LeftParen
    1958. 

  1958. 	  expression
    1959. 

  1959. 	  RightParen_ERR
    1960. 

  1960. 		{ $$ = (char *)$2.LIST_ABL->DATA; }
    1961. 

  1961. 	;
    1962. 

  1962. 

  1963. .GUARDED.
    1964. 

  1964. 	: /*empty*/
    1965. 

  1965. 		{ $$ = BVL_UNGDFN ; }
    1966. 

  1966. 	| GUARDED
    1967. 

  1967. 		{ $$ = BVL_GRDDFN; }
    1968. 

  1968. 	;
    1969. 

  1969. 

  1970. .simple_name.
    1971. 

  1971. 	: /*empty*/
    1972. 

  1972. 		{ $$ = NULL; }
    1973. 

  1973. 	| simple_name
    1974. 

  1974. 		{ $$ = $1; }
    1975. 

  1975. 	;
    1976. 

  1976. 

  1977. simple_name
    1978. 

  1978. 	: Identifier
    1979. 

  1979. 		{ $$ = $1; }
    1980. 

  1980. 	;
    1981. 

  1981. 

  1982. target
    1983. 

  1983. 	: name
    1984. 

  1984. 		{ $$ = $1; }
    1985. 

  1985. 	;
    1986. 

  1986. 

  1987. a_label
    1988. 

  1988. 	: label
    1989. 

  1989. 	  Colon
    1990. 

  1990. 		{
    1991. 

  1991. 		BVL_LBLNAM = $1;
    1992. 

  1992. 		$$ = $1;
    1993. 

  1993. 		}
    1994. 

  1994. 	;
    1995. 

  1995. 

  1996. label
    1997. 

  1997. 	: Identifier
    1998. 

  1998. 		{ $$ = $1; }
    1999. 

  1999. 	;
    2000. 

  2000. 

  2001. abstractlit
    2002. 

  2002. 	: AbstractLit
    2003. 

  2003. 		{ $$ = atoi ($1); }
    2004. 

  2004. 	;
    2005. 

  2005. 

  2006. RightParen_ERR
    2007. 

  2007. 	: RightParen
    2008. 

  2008. 		{ yyerrok; }
    2009. 

  2009. 	;
    2010. 

  2010. 

  2011. Semicolon_ERR
    2012. 

  2012. 	: Semicolon
    2013. 

  2013. 		{ yyerrok; }
    2014. 

  2014. 	;
    2015. 

  2015. 

  2016. END_ERR
    2017. 

  2017. 	: _END
    2018. 

  2018. 		{ yyerrok; }
    2019. 

  2019. 	;
    2020. 

  2020. %%
    2021. 

  2021. 

  2022. void *addstr (
    2023. 

  2023. 

  2024. struct befig *ptfig,
    2025. 

  2025. char          object,
    2026. 

  2026. long           mode,
    2027. 

  2027. long           type,
    2028. 

  2028. char          flag,
    2029. 

  2029. char         *name,
    2030. 

  2030. short         left,
    2031. 

  2031. short         right )
    2032. 

  2032. 

  2033.   {
    2034. 

  2034.   void  *pnt    = NULL;
    2035. 

  2035.   char   porflg = 0;
    2036. 

  2036.   char   rinflg = 0;
    2037. 

  2037.   char   outflg = 0;
    2038. 

  2038.   char   busflg = 0;
    2039. 

  2039.   char   auxflg = 0;
    2040. 

  2040.   char   buxflg = 0;
    2041. 

  2041.   char   regflg = 0;
    2042. 

  2042.   char   lclmod;
    2043. 

  2043.   char   lcltyp;
    2044. 

  2044.   char   extname[100];
    2045. 

  2045.   short  i;
    2046. 

  2046.   short  inc = 1;
    2047. 

  2047. 

  2048.   switch (object)
    2049. 

  2049.     {
    2050. 

  2050.     case 'P':
    2051. 

  2051. 

  2052. 	/* ###------------------------------------------------------### */
    2053. 

  2053. 	/*   if object is a port ...					*/
    2054. 

  2054. 	/* ###------------------------------------------------------### */
    2055. 

  2055. 

  2056.       porflg = 1;
    2057. 

  2057.       switch (mode)
    2058. 

  2058.         {
    2059. 

  2059.         case _IN:
    2060. 

  2060.           lclmod = 'I'; lcltyp = 'B'; rinflg = 1; break;
    2061. 

  2061.         case _OUT:
    2062. 

  2062.           switch (type)
    2063. 

  2063.             {
    2064. 

  2064.             case BIT:
    2065. 

  2065.               lclmod = 'O'; lcltyp = 'B'; outflg = 1; break;
    2066. 

  2066.             case MUX_BIT:
    2067. 

  2067.               lclmod = 'Z'; lcltyp = 'M'; busflg = 1; break;
    2068. 

  2068.             case WOR_BIT:
    2069. 

  2069.               lclmod = 'Z'; lcltyp = 'W'; busflg = 1; break;
    2070. 

  2070.             }
    2071. 

  2071.           break;
    2072. 

  2072.         case _INOUT:
    2073. 

  2073.           rinflg = 1;
    2074. 

  2074.           switch (type)
    2075. 

  2075.             {
    2076. 

  2076.             case BIT:
    2077. 

  2077.               lclmod = 'B'; lcltyp = 'B'; outflg = 1; break;
    2078. 

  2078.             case MUX_BIT:
    2079. 

  2079.               lclmod = 'T'; lcltyp = 'M'; busflg = 1; break;
    2080. 

  2080.             case WOR_BIT:
    2081. 

  2081.               lclmod = 'T'; lcltyp = 'W'; busflg = 1; break;
    2082. 

  2082.             }
    2083. 

  2083.           break;
    2084. 

  2084.         }
    2085. 

  2085.       break;
    2086. 

  2086. 

  2087.     case 'S':
    2088. 

  2088. 

  2089. 	/* ###------------------------------------------------------### */
    2090. 

  2090. 	/*   if object is a signal ...					*/
    2091. 

  2091. 	/* ###------------------------------------------------------### */
    2092. 

  2092. 

  2093.       switch (type)
    2094. 

  2094.         {
    2095. 

  2095.         case BIT:
    2096. 

  2096.           lcltyp = 'B'; rinflg = BVL_AUXMOD; auxflg = 1; break;
    2097. 

  2097.         case REG_BIT:
    2098. 

  2098.           rinflg = 1; regflg = 1; break;
    2099. 

  2099.         case MUX_BIT:
    2100. 

  2100.           lcltyp = 'M'; rinflg = 1; buxflg = 1; break;
    2101. 

  2101.         case WOR_BIT:
    2102. 

  2102.           lcltyp = 'W'; rinflg = 1; buxflg = 1; break;
    2103. 

  2103.         }
    2104. 

  2104.       break;
    2105. 

  2105.     }
    2106. 

  2106. 

  2107.   if (flag == 'S')
    2108. 

  2108.     {
    2109. 

  2109. 	/* ###------------------------------------------------------### */
    2110. 

  2110. 	/*   if object is a scalar ...					*/
    2111. 

  2111. 	/* ###------------------------------------------------------### */
    2112. 

  2112. 

  2113.     if (porflg == 1)
    2114. 

  2114.       ptfig->BEPOR = beh_addbepor (ptfig->BEPOR,name,lclmod,lcltyp);
    2115. 

  2115.     if (rinflg == 1)
    2116. 

  2116.       ptfig->BERIN = beh_addberin (ptfig->BERIN,name);
    2117. 

  2117.     if (outflg == 1)
    2118. 

  2118.       ptfig->BEOUT = beh_addbeout (ptfig->BEOUT,name,NULL,NULL);
    2119. 

  2119.     if (busflg == 1)
    2120. 

  2120.       ptfig->BEBUS = beh_addbebus (ptfig->BEBUS,name,NULL,NULL,lcltyp);
    2121. 

  2121.     if (auxflg == 1)
    2122. 

  2122.       ptfig->BEAUX = beh_addbeaux (ptfig->BEAUX,name,NULL,NULL);
    2123. 

  2123.     if (buxflg == 1)
    2124. 

  2124.       ptfig->BEBUX = beh_addbebux (ptfig->BEBUX,name,NULL,NULL,lcltyp);
    2125. 

  2125.     if (regflg == 1)
    2126. 

  2126.       ptfig->BEREG = beh_addbereg (ptfig->BEREG,name,NULL,NULL);
    2127. 

  2127. 

  2128.     }
    2129. 

  2129.   else
    2130. 

  2130.     {
    2131. 

  2131. 	/* ###------------------------------------------------------### */
    2132. 

  2132. 	/*   if object is an array ...					*/
    2133. 

  2133. 	/* ###------------------------------------------------------### */
    2134. 

  2134. 

  2135.     if (left >= right)
    2136. 

  2136.       inc = -1;
    2137. 

  2137. 

  2138.     for (i=left ; i!=(right+inc) ; i+=inc)
    2139. 

  2139.       {
    2140. 

  2140.       sprintf (extname,"%s %d",name,i);
    2141. 

  2141. 

  2142.       if (porflg == 1)
    2143. 

  2143.         ptfig->BEPOR = beh_addbepor (ptfig->BEPOR,extname,lclmod,lcltyp);
    2144. 

  2144.       if (rinflg == 1)
    2145. 

  2145.         ptfig->BERIN = beh_addberin (ptfig->BERIN,extname);
    2146. 

  2146.       if (outflg == 1)
    2147. 

  2147.         ptfig->BEOUT = beh_addbeout (ptfig->BEOUT,extname,NULL,NULL);
    2148. 

  2148.       if (busflg == 1)
    2149. 

  2149.         ptfig->BEBUS = beh_addbebus (ptfig->BEBUS,extname,NULL,NULL,lcltyp);
    2150. 

  2150.       if (auxflg == 1)
    2151. 

  2151.         ptfig->BEAUX = beh_addbeaux (ptfig->BEAUX,extname,NULL,NULL);
    2152. 

  2152.       if (buxflg == 1)
    2153. 

  2153.         ptfig->BEBUX = beh_addbebux (ptfig->BEBUX,extname,NULL,NULL,lcltyp);
    2154. 

  2154.       if (regflg == 1)
    2155. 

  2155.         ptfig->BEREG = beh_addbereg (ptfig->BEREG,extname,NULL,NULL);
    2156. 

  2156.       }
    2157. 

  2157.     }
    2158. 

  2158. 

  2159.   if (outflg == 1)
    2160. 

  2160.     pnt = (void *) ptfig->BEOUT;
    2161. 

  2161.   if (busflg == 1)
    2162. 

  2162.     pnt = (void *) ptfig->BEBUS;
    2163. 

  2163.   if (auxflg == 1)
    2164. 

  2164.     pnt = (void *) ptfig->BEAUX;
    2165. 

  2165.   if (buxflg == 1)
    2166. 

  2166.     pnt = (void *) ptfig->BEBUX;
    2167. 

  2167.   if (regflg == 1)
    2168. 

  2168.     pnt = (void *) ptfig->BEREG;
    2169. 

  2169. 

  2170.   return (pnt);
    2171. 

  2171.   }
    2172. 

  2172. 

  2173. static long 
    2174. 

  2174. chkdcl (
    2175. 

  2175. char object,
    2176. 

  2176. long  mode,
    2177. 

  2177. long  type,
    2178. 

  2178. char flag,
    2179. 

  2179. long  kind,
    2180. 

  2180. char constraint,
    2181. 

  2181. long  *conf  )
    2182. 

  2182. 

  2183.   {
    2184. 

  2184.   long errflg = 0;
    2185. 

  2185.   long lclcnf = 0;
    2186. 

  2186. 

  2187.   if (flag != constraint)
    2188. 

  2188.     {
    2189. 

  2189.     errflg = 1;
    2190. 

  2190.     bvl_error (33,NULL);
    2191. 

  2191.     }
    2192. 

  2192.   else
    2193. 

  2193.     {
    2194. 

  2194.     switch (object)
    2195. 

  2195.       {
    2196. 

  2196.       case 'P':
    2197. 

  2197. 	/* ###------------------------------------------------------### */
    2198. 

  2198. 	/*    If object is a port :					*/
    2199. 

  2199. 	/*       - if type is bit, no guard indication can be used	*/
    2200. 

  2200. 	/*       - if type is wor_bit or mux_bit, bus kind must be used	*/
    2201. 

  2201. 	/*       - other types are illegal				*/
    2202. 

  2202. 	/* ###------------------------------------------------------### */
    2203. 

  2203. 

  2204.         switch (type)
    2205. 

  2205.           {
    2206. 

  2206.           cas…
    2207.

Large files files are truncated, but you can click here to view the full file